/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:42:42,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:42:42,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:42:42,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:42:42,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:42:42,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:42:42,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:42:42,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:42:42,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:42:42,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:42:42,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:42:42,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:42:42,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:42:42,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:42:42,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:42:42,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:42:42,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:42:42,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:42:42,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:42:42,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:42:42,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:42:42,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:42:42,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:42:42,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:42:42,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:42:42,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:42:42,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:42:42,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:42:42,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:42:42,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:42:42,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:42:42,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:42:42,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:42:42,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:42:42,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:42:42,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:42:42,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:42:42,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:42:42,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:42:42,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:42:42,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:42:42,812 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:42,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:42:42,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:42:42,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:42:42,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:42:42,836 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:42:42,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:42:42,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:42:42,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:42:42,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:42:42,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:42:42,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:42:42,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:42:42,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:42:42,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:42:42,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:42:42,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:42:42,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:42:42,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:42:42,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:42:42,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:42:42,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:42:42,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:42:42,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:42:42,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:42:43,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:42:43,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:42:43,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:42:43,160 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:42:43,160 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:42:43,161 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2020-10-16 01:42:43,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92711ef79/19e7e570a8f34c6ba03bc88d05ede27b/FLAG9da256872 [2020-10-16 01:42:43,884 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:42:43,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2020-10-16 01:42:43,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92711ef79/19e7e570a8f34c6ba03bc88d05ede27b/FLAG9da256872 [2020-10-16 01:42:44,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92711ef79/19e7e570a8f34c6ba03bc88d05ede27b [2020-10-16 01:42:44,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:42:44,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:42:44,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:42:44,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:42:44,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:42:44,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:42:44" (1/1) ... [2020-10-16 01:42:44,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e26a2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:44, skipping insertion in model container [2020-10-16 01:42:44,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:42:44" (1/1) ... [2020-10-16 01:42:44,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:42:44,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:42:44,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:42:44,788 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:42:44,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:42:44,979 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:42:44,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:44 WrapperNode [2020-10-16 01:42:44,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:42:44,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:42:44,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:42:44,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:42:44,990 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:44" (1/1) ... [2020-10-16 01:42:45,014 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:44" (1/1) ... [2020-10-16 01:42:45,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:42:45,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:42:45,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:42:45,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:42:45,068 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:44" (1/1) ... [2020-10-16 01:42:45,068 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:44" (1/1) ... [2020-10-16 01:42:45,075 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:44" (1/1) ... [2020-10-16 01:42:45,076 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:44" (1/1) ... [2020-10-16 01:42:45,094 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:44" (1/1) ... [2020-10-16 01:42:45,112 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:44" (1/1) ... [2020-10-16 01:42:45,122 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:44" (1/1) ... [2020-10-16 01:42:45,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:42:45,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:42:45,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:42:45,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:42:45,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:44" (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:45,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:42:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:42:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:42:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:42:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:42:45,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:42:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:42:45,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:42:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:42:45,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:42:45,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:42:45,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:42:45,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:42:45,240 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:49,167 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:42:49,168 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:42:49,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:42:49 BoogieIcfgContainer [2020-10-16 01:42:49,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:42:49,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:42:49,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:42:49,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:42:49,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:42:44" (1/3) ... [2020-10-16 01:42:49,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781acbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:42:49, skipping insertion in model container [2020-10-16 01:42:49,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:44" (2/3) ... [2020-10-16 01:42:49,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781acbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:42:49, skipping insertion in model container [2020-10-16 01:42:49,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:42:49" (3/3) ... [2020-10-16 01:42:49,180 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i [2020-10-16 01:42:49,197 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:42:49,209 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:42:49,210 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:42:49,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,261 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,277 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,277 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,278 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:49,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,278 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:49,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,282 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,301 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:49,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,313 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:49,353 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:42:49,385 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:42:49,385 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:42:49,385 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:42:49,386 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:42:49,386 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:42:49,386 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:42:49,386 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:42:49,387 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:42:49,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 01:42:49,461 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 01:42:49,462 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:49,467 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:49,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 01:42:49,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:49,480 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:42:49,483 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:49,486 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:49,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:49,515 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 01:42:49,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:49,517 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:49,519 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 01:42:49,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:49,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:49,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:49,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:49,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:49,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:49,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:49,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:49,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:49,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:49,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,805 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:49,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:49,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:49,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:49,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:49,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:49,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,835 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:49,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:49,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:49,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:49,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:49,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:49,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:49,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:49,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:49,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:49,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:49,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:49,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:49,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:49,984 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:49,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:49,986 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:49,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:50,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:50,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:50,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:50,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:50,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,071 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:50,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:50,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:50,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,094 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:50,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:50,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,174 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:50,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:50,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:50,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,199 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:50,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:50,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:50,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:50,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,673 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:42:50,793 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:42:50,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:50,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:50,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:50,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:50,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:50,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:50,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:50,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:50,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,196 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:51,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,217 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:51,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:51,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:51,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:51,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:51,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,318 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:51,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,319 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:51,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:51,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:51,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,390 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:51,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,410 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:51,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:51,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,623 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:42:51,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,753 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:51,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:51,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,773 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:51,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:51,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:51,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:52,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,096 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,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,102 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,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:52,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,200 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,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,201 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,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,338 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:52,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,358 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,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:42:52,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:42:52,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:42:52,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:52,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,452 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:52,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,454 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:52,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,456 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:52,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,461 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:52,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,463 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:52,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,573 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,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,589 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:52,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,342 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:53,474 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 01:42:53,481 INFO L132 LiptonReduction]: Checked pairs total: 5549 [2020-10-16 01:42:53,482 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 01:42:53,485 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4008 [2020-10-16 01:42:53,492 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 01:42:53,493 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:53,493 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:53,494 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:42:53,495 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:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-16 01:42:53,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:53,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267274302] [2020-10-16 01:42:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:53,782 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:53,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267274302] [2020-10-16 01:42:53,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:53,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:42:53,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406093040] [2020-10-16 01:42:53,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:42:53,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:42:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:42:53,815 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:42:53,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 01:42:53,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:53,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:42:53,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:54,097 INFO L129 PetriNetUnfolder]: 190/405 cut-off events. [2020-10-16 01:42:54,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:54,099 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:54,104 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 01:42:54,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 105 flow [2020-10-16 01:42:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:42:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:42:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 01:42:54,122 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2020-10-16 01:42:54,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 01:42:54,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 01:42:54,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:54,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 01:42:54,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:42:54,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:42:54,144 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:42:54,146 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:54,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 105 flow [2020-10-16 01:42:54,150 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:54,152 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 01:42:54,155 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:54,156 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 01:42:54,157 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 01:42:54,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:42:54,157 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:54,157 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:54,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:42:54,157 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:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-16 01:42:54,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:54,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165054776] [2020-10-16 01:42:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:54,372 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:54,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165054776] [2020-10-16 01:42:54,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:54,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:42:54,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881622] [2020-10-16 01:42:54,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:42:54,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:42:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:42:54,379 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2020-10-16 01:42:54,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states. [2020-10-16 01:42:54,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:54,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2020-10-16 01:42:54,380 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:54,444 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2020-10-16 01:42:54,444 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:54,444 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 45. Up to 5 conditions per place. [2020-10-16 01:42:54,445 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2020-10-16 01:42:54,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 84 flow [2020-10-16 01:42:54,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:42:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:42:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2020-10-16 01:42:54,450 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2020-10-16 01:42:54,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2020-10-16 01:42:54,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2020-10-16 01:42:54,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:54,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2020-10-16 01:42:54,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:42:54,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:42:54,456 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:42:54,456 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 706 transitions. [2020-10-16 01:42:54,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 84 flow [2020-10-16 01:42:54,457 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:54,458 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 64 flow [2020-10-16 01:42:54,458 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:54,459 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 01:42:54,459 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 64 flow [2020-10-16 01:42:54,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:42:54,459 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:54,460 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:54,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:42:54,460 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:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -584206169, now seen corresponding path program 1 times [2020-10-16 01:42:54,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:54,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467366165] [2020-10-16 01:42:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:54,700 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:54,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467366165] [2020-10-16 01:42:54,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:54,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:42:54,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865894504] [2020-10-16 01:42:54,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:42:54,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:42:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:42:54,706 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 171 [2020-10-16 01:42:54,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 64 flow. Second operand 4 states. [2020-10-16 01:42:54,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:54,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 171 [2020-10-16 01:42:54,708 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:54,753 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2020-10-16 01:42:54,753 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:42:54,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 2/30 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 01:42:54,754 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2020-10-16 01:42:54,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 82 flow [2020-10-16 01:42:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:42:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:42:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2020-10-16 01:42:54,757 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.816374269005848 [2020-10-16 01:42:54,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2020-10-16 01:42:54,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2020-10-16 01:42:54,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:54,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2020-10-16 01:42:54,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:42:54,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:42:54,762 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:42:54,762 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 64 flow. Second operand 5 states and 698 transitions. [2020-10-16 01:42:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 82 flow [2020-10-16 01:42:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 74 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:54,764 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 68 flow [2020-10-16 01:42:54,764 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2020-10-16 01:42:54,765 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 01:42:54,765 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 68 flow [2020-10-16 01:42:54,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:42:54,765 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:54,765 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:54,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:42:54,765 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:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash -930418839, now seen corresponding path program 1 times [2020-10-16 01:42:54,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:54,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965116156] [2020-10-16 01:42:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:54,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965116156] [2020-10-16 01:42:54,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:54,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:42:54,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109522574] [2020-10-16 01:42:54,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:42:54,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:42:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:42:54,963 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2020-10-16 01:42:54,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 68 flow. Second operand 5 states. [2020-10-16 01:42:54,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:54,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2020-10-16 01:42:54,964 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:55,034 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2020-10-16 01:42:55,035 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2020-10-16 01:42:55,035 INFO L80 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 33 events. 1/33 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 3/36 useless extension candidates. Maximal degree in co-relation 59. Up to 6 conditions per place. [2020-10-16 01:42:55,035 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 2 selfloop transitions, 3 changer transitions 4/27 dead transitions. [2020-10-16 01:42:55,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 105 flow [2020-10-16 01:42:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:42:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:42:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2020-10-16 01:42:55,039 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8060428849902534 [2020-10-16 01:42:55,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2020-10-16 01:42:55,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2020-10-16 01:42:55,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:55,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2020-10-16 01:42:55,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:42:55,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:42:55,044 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:42:55,044 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 68 flow. Second operand 6 states and 827 transitions. [2020-10-16 01:42:55,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 105 flow [2020-10-16 01:42:55,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 95 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:55,046 INFO L241 Difference]: Finished difference. Result has 41 places, 23 transitions, 78 flow [2020-10-16 01:42:55,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2020-10-16 01:42:55,047 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2020-10-16 01:42:55,047 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 78 flow [2020-10-16 01:42:55,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:42:55,047 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:55,047 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:55,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:42:55,047 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:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -833723287, now seen corresponding path program 1 times [2020-10-16 01:42:55,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:55,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440897363] [2020-10-16 01:42:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:55,391 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:55,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440897363] [2020-10-16 01:42:55,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:55,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:42:55,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426737895] [2020-10-16 01:42:55,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:42:55,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:42:55,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:42:55,396 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 01:42:55,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 78 flow. Second operand 9 states. [2020-10-16 01:42:55,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:55,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 01:42:55,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:56,153 INFO L129 PetriNetUnfolder]: 242/497 cut-off events. [2020-10-16 01:42:56,153 INFO L130 PetriNetUnfolder]: For 324/326 co-relation queries the response was YES. [2020-10-16 01:42:56,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 497 events. 242/497 cut-off events. For 324/326 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2627 event pairs, 29 based on Foata normal form. 32/524 useless extension candidates. Maximal degree in co-relation 1124. Up to 225 conditions per place. [2020-10-16 01:42:56,158 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 19 selfloop transitions, 13 changer transitions 14/57 dead transitions. [2020-10-16 01:42:56,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 256 flow [2020-10-16 01:42:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:42:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:42:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2020-10-16 01:42:56,164 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6660818713450293 [2020-10-16 01:42:56,164 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2020-10-16 01:42:56,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2020-10-16 01:42:56,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:56,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2020-10-16 01:42:56,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:42:56,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:42:56,171 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:42:56,172 INFO L185 Difference]: Start difference. First operand has 41 places, 23 transitions, 78 flow. Second operand 10 states and 1139 transitions. [2020-10-16 01:42:56,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 256 flow [2020-10-16 01:42:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 232 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 01:42:56,180 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 147 flow [2020-10-16 01:42:56,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2020-10-16 01:42:56,181 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2020-10-16 01:42:56,181 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 147 flow [2020-10-16 01:42:56,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:42:56,181 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:56,181 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:56,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:42:56,182 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:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1891864235, now seen corresponding path program 1 times [2020-10-16 01:42:56,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:56,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415720378] [2020-10-16 01:42:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:56,327 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,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415720378] [2020-10-16 01:42:56,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:56,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:42:56,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659303466] [2020-10-16 01:42:56,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:42:56,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:42:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:42:56,330 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:42:56,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 147 flow. Second operand 4 states. [2020-10-16 01:42:56,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:56,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:42:56,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:56,422 INFO L129 PetriNetUnfolder]: 148/386 cut-off events. [2020-10-16 01:42:56,423 INFO L130 PetriNetUnfolder]: For 151/165 co-relation queries the response was YES. [2020-10-16 01:42:56,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 386 events. 148/386 cut-off events. For 151/165 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2514 event pairs, 50 based on Foata normal form. 48/398 useless extension candidates. Maximal degree in co-relation 844. Up to 222 conditions per place. [2020-10-16 01:42:56,427 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2020-10-16 01:42:56,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 199 flow [2020-10-16 01:42:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:42:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:42:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2020-10-16 01:42:56,431 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-16 01:42:56,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2020-10-16 01:42:56,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2020-10-16 01:42:56,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:56,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2020-10-16 01:42:56,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:42:56,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:42:56,436 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:42:56,436 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 147 flow. Second operand 5 states and 718 transitions. [2020-10-16 01:42:56,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 199 flow [2020-10-16 01:42:56,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 192 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:56,439 INFO L241 Difference]: Finished difference. Result has 48 places, 40 transitions, 200 flow [2020-10-16 01:42:56,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2020-10-16 01:42:56,440 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2020-10-16 01:42:56,440 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 200 flow [2020-10-16 01:42:56,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:42:56,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:56,440 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:42:56,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:42:56,441 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:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1993342053, now seen corresponding path program 1 times [2020-10-16 01:42:56,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:56,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995125842] [2020-10-16 01:42:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:56,576 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,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995125842] [2020-10-16 01:42:56,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:56,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:42:56,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798901990] [2020-10-16 01:42:56,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:42:56,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:42:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:42:56,579 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:42:56,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 200 flow. Second operand 5 states. [2020-10-16 01:42:56,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:56,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:42:56,580 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:56,692 INFO L129 PetriNetUnfolder]: 106/333 cut-off events. [2020-10-16 01:42:56,692 INFO L130 PetriNetUnfolder]: For 487/1058 co-relation queries the response was YES. [2020-10-16 01:42:56,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 333 events. 106/333 cut-off events. For 487/1058 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2180 event pairs, 6 based on Foata normal form. 167/476 useless extension candidates. Maximal degree in co-relation 1139. Up to 202 conditions per place. [2020-10-16 01:42:56,696 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 15 changer transitions 3/50 dead transitions. [2020-10-16 01:42:56,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 304 flow [2020-10-16 01:42:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:42:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:42:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2020-10-16 01:42:56,700 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2020-10-16 01:42:56,700 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2020-10-16 01:42:56,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2020-10-16 01:42:56,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:56,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2020-10-16 01:42:56,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:42:56,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:42:56,707 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:42:56,707 INFO L185 Difference]: Start difference. First operand has 48 places, 40 transitions, 200 flow. Second operand 7 states and 1005 transitions. [2020-10-16 01:42:56,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 304 flow [2020-10-16 01:42:56,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:42:56,711 INFO L241 Difference]: Finished difference. Result has 56 places, 47 transitions, 295 flow [2020-10-16 01:42:56,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2020-10-16 01:42:56,712 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2020-10-16 01:42:56,712 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 295 flow [2020-10-16 01:42:56,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:42:56,712 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:56,712 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:42:56,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:42:56,713 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:42:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 661283394, now seen corresponding path program 1 times [2020-10-16 01:42:56,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:56,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422438154] [2020-10-16 01:42:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:56,854 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,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422438154] [2020-10-16 01:42:56,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:56,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:42:56,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778263782] [2020-10-16 01:42:56,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:42:56,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:42:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:42:56,858 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:42:56,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 295 flow. Second operand 6 states. [2020-10-16 01:42:56,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:56,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:42:56,859 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:57,001 INFO L129 PetriNetUnfolder]: 82/282 cut-off events. [2020-10-16 01:42:57,002 INFO L130 PetriNetUnfolder]: For 1033/1749 co-relation queries the response was YES. [2020-10-16 01:42:57,004 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 282 events. 82/282 cut-off events. For 1033/1749 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1848 event pairs, 0 based on Foata normal form. 195/455 useless extension candidates. Maximal degree in co-relation 1239. Up to 175 conditions per place. [2020-10-16 01:42:57,006 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 19 changer transitions 3/51 dead transitions. [2020-10-16 01:42:57,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 373 flow [2020-10-16 01:42:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:42:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:42:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2020-10-16 01:42:57,011 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356075373619233 [2020-10-16 01:42:57,011 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2020-10-16 01:42:57,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2020-10-16 01:42:57,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:57,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2020-10-16 01:42:57,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:42:57,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:42:57,020 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:42:57,020 INFO L185 Difference]: Start difference. First operand has 56 places, 47 transitions, 295 flow. Second operand 9 states and 1286 transitions. [2020-10-16 01:42:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 373 flow [2020-10-16 01:42:57,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 329 flow, removed 15 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:57,032 INFO L241 Difference]: Finished difference. Result has 63 places, 48 transitions, 312 flow [2020-10-16 01:42:57,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2020-10-16 01:42:57,033 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2020-10-16 01:42:57,033 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 312 flow [2020-10-16 01:42:57,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:42:57,033 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:57,033 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:42:57,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:42:57,033 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:42:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 646335877, now seen corresponding path program 1 times [2020-10-16 01:42:57,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:57,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862286246] [2020-10-16 01:42:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:57,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862286246] [2020-10-16 01:42:57,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:57,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:42:57,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295763811] [2020-10-16 01:42:57,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:42:57,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:42:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:42:57,226 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 171 [2020-10-16 01:42:57,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 312 flow. Second operand 6 states. [2020-10-16 01:42:57,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:57,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 171 [2020-10-16 01:42:57,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:57,565 INFO L129 PetriNetUnfolder]: 180/584 cut-off events. [2020-10-16 01:42:57,566 INFO L130 PetriNetUnfolder]: For 3000/3371 co-relation queries the response was YES. [2020-10-16 01:42:57,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 584 events. 180/584 cut-off events. For 3000/3371 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4603 event pairs, 13 based on Foata normal form. 104/657 useless extension candidates. Maximal degree in co-relation 2295. Up to 165 conditions per place. [2020-10-16 01:42:57,573 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 21 selfloop transitions, 12 changer transitions 18/77 dead transitions. [2020-10-16 01:42:57,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 554 flow [2020-10-16 01:42:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:42:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:42:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2020-10-16 01:42:57,577 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6791979949874687 [2020-10-16 01:42:57,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2020-10-16 01:42:57,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2020-10-16 01:42:57,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:57,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2020-10-16 01:42:57,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:42:57,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:42:57,583 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:42:57,584 INFO L185 Difference]: Start difference. First operand has 63 places, 48 transitions, 312 flow. Second operand 7 states and 813 transitions. [2020-10-16 01:42:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 554 flow [2020-10-16 01:42:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 490 flow, removed 15 selfloop flow, removed 8 redundant places. [2020-10-16 01:42:57,602 INFO L241 Difference]: Finished difference. Result has 65 places, 58 transitions, 362 flow [2020-10-16 01:42:57,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2020-10-16 01:42:57,603 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2020-10-16 01:42:57,603 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 362 flow [2020-10-16 01:42:57,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:42:57,603 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:57,604 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:42:57,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:42:57,604 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:42:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1186111401, now seen corresponding path program 2 times [2020-10-16 01:42:57,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:57,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455552568] [2020-10-16 01:42:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:58,061 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,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455552568] [2020-10-16 01:42:58,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:58,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:42:58,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4657969] [2020-10-16 01:42:58,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:42:58,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:42:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:42:58,066 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 171 [2020-10-16 01:42:58,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 362 flow. Second operand 9 states. [2020-10-16 01:42:58,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:58,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 171 [2020-10-16 01:42:58,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:58,498 INFO L129 PetriNetUnfolder]: 182/595 cut-off events. [2020-10-16 01:42:58,498 INFO L130 PetriNetUnfolder]: For 1631/1971 co-relation queries the response was YES. [2020-10-16 01:42:58,502 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 595 events. 182/595 cut-off events. For 1631/1971 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4740 event pairs, 2 based on Foata normal form. 115/680 useless extension candidates. Maximal degree in co-relation 2137. Up to 155 conditions per place. [2020-10-16 01:42:58,505 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 28 selfloop transitions, 8 changer transitions 16/78 dead transitions. [2020-10-16 01:42:58,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 586 flow [2020-10-16 01:42:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:42:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:42:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 883 transitions. [2020-10-16 01:42:58,509 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.64546783625731 [2020-10-16 01:42:58,509 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 883 transitions. [2020-10-16 01:42:58,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 883 transitions. [2020-10-16 01:42:58,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:58,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 883 transitions. [2020-10-16 01:42:58,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:42:58,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:42:58,516 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:42:58,516 INFO L185 Difference]: Start difference. First operand has 65 places, 58 transitions, 362 flow. Second operand 8 states and 883 transitions. [2020-10-16 01:42:58,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 586 flow [2020-10-16 01:42:58,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 566 flow, removed 10 selfloop flow, removed 3 redundant places. [2020-10-16 01:42:58,535 INFO L241 Difference]: Finished difference. Result has 70 places, 60 transitions, 404 flow [2020-10-16 01:42:58,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2020-10-16 01:42:58,537 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2020-10-16 01:42:58,537 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 404 flow [2020-10-16 01:42:58,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:42:58,537 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:58,538 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:42:58,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:42:58,538 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:42:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1935213903, now seen corresponding path program 3 times [2020-10-16 01:42:58,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:58,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519300201] [2020-10-16 01:42:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:59,279 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2020-10-16 01:42:59,414 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 20 [2020-10-16 01:42:59,575 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,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519300201] [2020-10-16 01:42:59,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:59,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:42:59,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953809482] [2020-10-16 01:42:59,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:42:59,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:42:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:42:59,581 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 01:42:59,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 404 flow. Second operand 9 states. [2020-10-16 01:42:59,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:59,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 01:42:59,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:00,381 INFO L129 PetriNetUnfolder]: 183/610 cut-off events. [2020-10-16 01:43:00,382 INFO L130 PetriNetUnfolder]: For 1800/2190 co-relation queries the response was YES. [2020-10-16 01:43:00,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 610 events. 183/610 cut-off events. For 1800/2190 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4930 event pairs, 1 based on Foata normal form. 140/712 useless extension candidates. Maximal degree in co-relation 2241. Up to 185 conditions per place. [2020-10-16 01:43:00,392 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 28 selfloop transitions, 15 changer transitions 17/86 dead transitions. [2020-10-16 01:43:00,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 86 transitions, 698 flow [2020-10-16 01:43:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:43:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:43:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2020-10-16 01:43:00,397 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6341780376868096 [2020-10-16 01:43:00,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 976 transitions. [2020-10-16 01:43:00,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 976 transitions. [2020-10-16 01:43:00,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:00,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 976 transitions. [2020-10-16 01:43:00,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:43:00,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:43:00,404 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:43:00,404 INFO L185 Difference]: Start difference. First operand has 70 places, 60 transitions, 404 flow. Second operand 9 states and 976 transitions. [2020-10-16 01:43:00,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 86 transitions, 698 flow [2020-10-16 01:43:00,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 86 transitions, 677 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 01:43:00,424 INFO L241 Difference]: Finished difference. Result has 75 places, 61 transitions, 456 flow [2020-10-16 01:43:00,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=456, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2020-10-16 01:43:00,425 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2020-10-16 01:43:00,425 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 456 flow [2020-10-16 01:43:00,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:00,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:00,425 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:00,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:43:00,426 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:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -446157155, now seen corresponding path program 4 times [2020-10-16 01:43:00,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:00,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705464588] [2020-10-16 01:43:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:01,056 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,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705464588] [2020-10-16 01:43:01,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:01,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:43:01,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043037834] [2020-10-16 01:43:01,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:43:01,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:01,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:43:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:43:01,060 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 01:43:01,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 456 flow. Second operand 11 states. [2020-10-16 01:43:01,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:01,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 01:43:01,061 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:01,891 INFO L129 PetriNetUnfolder]: 149/502 cut-off events. [2020-10-16 01:43:01,892 INFO L130 PetriNetUnfolder]: For 1626/1916 co-relation queries the response was YES. [2020-10-16 01:43:01,895 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 502 events. 149/502 cut-off events. For 1626/1916 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3827 event pairs, 6 based on Foata normal form. 95/562 useless extension candidates. Maximal degree in co-relation 1917. Up to 145 conditions per place. [2020-10-16 01:43:01,898 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 30 selfloop transitions, 14 changer transitions 11/81 dead transitions. [2020-10-16 01:43:01,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 723 flow [2020-10-16 01:43:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:43:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:43:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1043 transitions. [2020-10-16 01:43:01,902 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6099415204678362 [2020-10-16 01:43:01,902 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1043 transitions. [2020-10-16 01:43:01,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1043 transitions. [2020-10-16 01:43:01,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:01,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1043 transitions. [2020-10-16 01:43:01,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:43:01,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:43:01,910 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:43:01,910 INFO L185 Difference]: Start difference. First operand has 75 places, 61 transitions, 456 flow. Second operand 10 states and 1043 transitions. [2020-10-16 01:43:01,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 723 flow [2020-10-16 01:43:01,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 694 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-16 01:43:01,922 INFO L241 Difference]: Finished difference. Result has 82 places, 64 transitions, 514 flow [2020-10-16 01:43:01,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=514, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2020-10-16 01:43:01,923 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2020-10-16 01:43:01,923 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 514 flow [2020-10-16 01:43:01,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:43:01,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:01,924 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,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:43:01,924 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:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2087874151, now seen corresponding path program 5 times [2020-10-16 01:43:01,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:01,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263676910] [2020-10-16 01:43:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:02,518 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 27 [2020-10-16 01:43:02,663 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2020-10-16 01:43:02,814 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2020-10-16 01:43:02,999 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2020-10-16 01:43:03,143 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2020-10-16 01:43:03,287 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,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263676910] [2020-10-16 01:43:03,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:03,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 01:43:03,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560465719] [2020-10-16 01:43:03,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 01:43:03,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 01:43:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-16 01:43:03,291 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 171 [2020-10-16 01:43:03,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 514 flow. Second operand 13 states. [2020-10-16 01:43:03,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:03,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 171 [2020-10-16 01:43:03,292 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:04,240 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-16 01:43:04,268 INFO L129 PetriNetUnfolder]: 168/545 cut-off events. [2020-10-16 01:43:04,268 INFO L130 PetriNetUnfolder]: For 1996/2313 co-relation queries the response was YES. [2020-10-16 01:43:04,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 545 events. 168/545 cut-off events. For 1996/2313 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4089 event pairs, 7 based on Foata normal form. 99/608 useless extension candidates. Maximal degree in co-relation 2187. Up to 155 conditions per place. [2020-10-16 01:43:04,276 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 35 selfloop transitions, 11 changer transitions 14/86 dead transitions. [2020-10-16 01:43:04,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 840 flow [2020-10-16 01:43:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:43:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:43:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1024 transitions. [2020-10-16 01:43:04,286 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5988304093567252 [2020-10-16 01:43:04,286 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1024 transitions. [2020-10-16 01:43:04,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1024 transitions. [2020-10-16 01:43:04,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:04,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1024 transitions. [2020-10-16 01:43:04,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:43:04,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:43:04,295 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:43:04,296 INFO L185 Difference]: Start difference. First operand has 82 places, 64 transitions, 514 flow. Second operand 10 states and 1024 transitions. [2020-10-16 01:43:04,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 840 flow [2020-10-16 01:43:04,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 758 flow, removed 28 selfloop flow, removed 7 redundant places. [2020-10-16 01:43:04,311 INFO L241 Difference]: Finished difference. Result has 85 places, 69 transitions, 565 flow [2020-10-16 01:43:04,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=565, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2020-10-16 01:43:04,312 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2020-10-16 01:43:04,312 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 565 flow [2020-10-16 01:43:04,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 01:43:04,355 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:04,355 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:04,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:43:04,356 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:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 246481851, now seen corresponding path program 6 times [2020-10-16 01:43:04,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:04,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750541056] [2020-10-16 01:43:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:05,141 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:05,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750541056] [2020-10-16 01:43:05,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:05,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 01:43:05,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617135685] [2020-10-16 01:43:05,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 01:43:05,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 01:43:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-16 01:43:05,146 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 171 [2020-10-16 01:43:05,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 565 flow. Second operand 14 states. [2020-10-16 01:43:05,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:05,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 171 [2020-10-16 01:43:05,148 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:06,315 INFO L129 PetriNetUnfolder]: 787/1505 cut-off events. [2020-10-16 01:43:06,315 INFO L130 PetriNetUnfolder]: For 5992/6142 co-relation queries the response was YES. [2020-10-16 01:43:06,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7297 conditions, 1505 events. 787/1505 cut-off events. For 5992/6142 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9336 event pairs, 139 based on Foata normal form. 29/1528 useless extension candidates. Maximal degree in co-relation 7265. Up to 873 conditions per place. [2020-10-16 01:43:06,331 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 47 selfloop transitions, 25 changer transitions 84/163 dead transitions. [2020-10-16 01:43:06,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 163 transitions, 1534 flow [2020-10-16 01:43:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 01:43:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 01:43:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1535 transitions. [2020-10-16 01:43:06,337 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5610380116959064 [2020-10-16 01:43:06,337 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1535 transitions. [2020-10-16 01:43:06,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1535 transitions. [2020-10-16 01:43:06,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:06,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1535 transitions. [2020-10-16 01:43:06,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 01:43:06,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 01:43:06,345 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 01:43:06,346 INFO L185 Difference]: Start difference. First operand has 85 places, 69 transitions, 565 flow. Second operand 16 states and 1535 transitions. [2020-10-16 01:43:06,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 163 transitions, 1534 flow [2020-10-16 01:43:06,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 163 transitions, 1487 flow, removed 20 selfloop flow, removed 5 redundant places. [2020-10-16 01:43:06,383 INFO L241 Difference]: Finished difference. Result has 104 places, 70 transitions, 688 flow [2020-10-16 01:43:06,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=688, PETRI_PLACES=104, PETRI_TRANSITIONS=70} [2020-10-16 01:43:06,383 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2020-10-16 01:43:06,384 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 70 transitions, 688 flow [2020-10-16 01:43:06,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 01:43:06,384 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:06,384 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,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:43:06,384 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,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1061023369, now seen corresponding path program 7 times [2020-10-16 01:43:06,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:06,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673185200] [2020-10-16 01:43:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:06,642 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,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673185200] [2020-10-16 01:43:06,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:06,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:43:06,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311736974] [2020-10-16 01:43:06,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:43:06,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:43:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:43:06,645 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 01:43:06,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 70 transitions, 688 flow. Second operand 8 states. [2020-10-16 01:43:06,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:06,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 01:43:06,646 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:07,130 INFO L129 PetriNetUnfolder]: 121/336 cut-off events. [2020-10-16 01:43:07,131 INFO L130 PetriNetUnfolder]: For 2156/2324 co-relation queries the response was YES. [2020-10-16 01:43:07,134 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 336 events. 121/336 cut-off events. For 2156/2324 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1794 event pairs, 17 based on Foata normal form. 36/360 useless extension candidates. Maximal degree in co-relation 1731. Up to 93 conditions per place. [2020-10-16 01:43:07,137 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 28 selfloop transitions, 27 changer transitions 7/84 dead transitions. [2020-10-16 01:43:07,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 84 transitions, 951 flow [2020-10-16 01:43:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:43:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:43:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1115 transitions. [2020-10-16 01:43:07,142 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.652046783625731 [2020-10-16 01:43:07,142 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1115 transitions. [2020-10-16 01:43:07,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1115 transitions. [2020-10-16 01:43:07,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:07,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1115 transitions. [2020-10-16 01:43:07,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:43:07,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:43:07,147 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:43:07,147 INFO L185 Difference]: Start difference. First operand has 104 places, 70 transitions, 688 flow. Second operand 10 states and 1115 transitions. [2020-10-16 01:43:07,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 84 transitions, 951 flow [2020-10-16 01:43:07,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 84 transitions, 894 flow, removed 27 selfloop flow, removed 11 redundant places. [2020-10-16 01:43:07,162 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 772 flow [2020-10-16 01:43:07,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=772, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-16 01:43:07,163 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2020-10-16 01:43:07,163 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 772 flow [2020-10-16 01:43:07,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:43:07,163 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:07,163 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,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:43:07,163 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,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -517163577, now seen corresponding path program 8 times [2020-10-16 01:43:07,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:07,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656289915] [2020-10-16 01:43:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:07,967 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,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656289915] [2020-10-16 01:43:07,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:07,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 01:43:07,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479418861] [2020-10-16 01:43:07,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 01:43:07,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 01:43:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-16 01:43:07,971 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 171 [2020-10-16 01:43:07,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 772 flow. Second operand 14 states. [2020-10-16 01:43:07,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:07,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 171 [2020-10-16 01:43:07,972 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:09,307 INFO L129 PetriNetUnfolder]: 295/598 cut-off events. [2020-10-16 01:43:09,308 INFO L130 PetriNetUnfolder]: For 4265/4474 co-relation queries the response was YES. [2020-10-16 01:43:09,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 598 events. 295/598 cut-off events. For 4265/4474 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2965 event pairs, 9 based on Foata normal form. 63/660 useless extension candidates. Maximal degree in co-relation 3343. Up to 287 conditions per place. [2020-10-16 01:43:09,316 INFO L132 encePairwiseOnDemand]: 157/171 looper letters, 69 selfloop transitions, 63 changer transitions 39/178 dead transitions. [2020-10-16 01:43:09,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 178 transitions, 2135 flow [2020-10-16 01:43:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 01:43:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 01:43:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1370 transitions. [2020-10-16 01:43:09,320 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5722639933166249 [2020-10-16 01:43:09,320 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1370 transitions. [2020-10-16 01:43:09,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1370 transitions. [2020-10-16 01:43:09,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:09,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1370 transitions. [2020-10-16 01:43:09,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 01:43:09,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 01:43:09,326 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 01:43:09,326 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 772 flow. Second operand 14 states and 1370 transitions. [2020-10-16 01:43:09,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 178 transitions, 2135 flow [2020-10-16 01:43:09,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 178 transitions, 1998 flow, removed 31 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:09,352 INFO L241 Difference]: Finished difference. Result has 110 places, 116 transitions, 1417 flow [2020-10-16 01:43:09,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1417, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2020-10-16 01:43:09,353 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2020-10-16 01:43:09,354 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 1417 flow [2020-10-16 01:43:09,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 01:43:09,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:09,354 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:09,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:43:09,355 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:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1147959281, now seen corresponding path program 9 times [2020-10-16 01:43:09,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:09,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073657685] [2020-10-16 01:43:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:09,679 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-16 01:43:09,889 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2020-10-16 01:43:10,012 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2020-10-16 01:43:10,252 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:10,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073657685] [2020-10-16 01:43:10,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:10,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:43:10,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355763259] [2020-10-16 01:43:10,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:43:10,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:10,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:43:10,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:43:10,261 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 171 [2020-10-16 01:43:10,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 1417 flow. Second operand 11 states. [2020-10-16 01:43:10,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:10,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 171 [2020-10-16 01:43:10,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:10,383 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-10-16 01:43:10,508 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2020-10-16 01:43:11,172 INFO L129 PetriNetUnfolder]: 195/493 cut-off events. [2020-10-16 01:43:11,172 INFO L130 PetriNetUnfolder]: For 4736/4951 co-relation queries the response was YES. [2020-10-16 01:43:11,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 493 events. 195/493 cut-off events. For 4736/4951 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2904 event pairs, 8 based on Foata normal form. 51/542 useless extension candidates. Maximal degree in co-relation 3111. Up to 156 conditions per place. [2020-10-16 01:43:11,181 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 49 selfloop transitions, 48 changer transitions 11/143 dead transitions. [2020-10-16 01:43:11,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 143 transitions, 1918 flow [2020-10-16 01:43:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:43:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:43:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1131 transitions. [2020-10-16 01:43:11,184 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6012759170653907 [2020-10-16 01:43:11,184 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1131 transitions. [2020-10-16 01:43:11,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1131 transitions. [2020-10-16 01:43:11,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:11,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1131 transitions. [2020-10-16 01:43:11,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:43:11,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:43:11,191 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:43:11,191 INFO L185 Difference]: Start difference. First operand has 110 places, 116 transitions, 1417 flow. Second operand 11 states and 1131 transitions. [2020-10-16 01:43:11,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 143 transitions, 1918 flow [2020-10-16 01:43:11,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 143 transitions, 1802 flow, removed 47 selfloop flow, removed 3 redundant places. [2020-10-16 01:43:11,222 INFO L241 Difference]: Finished difference. Result has 120 places, 124 transitions, 1596 flow [2020-10-16 01:43:11,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1596, PETRI_PLACES=120, PETRI_TRANSITIONS=124} [2020-10-16 01:43:11,223 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 85 predicate places. [2020-10-16 01:43:11,223 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 1596 flow [2020-10-16 01:43:11,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:43:11,223 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:11,223 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:11,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:43:11,224 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:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1307172725, now seen corresponding path program 10 times [2020-10-16 01:43:11,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:11,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627275603] [2020-10-16 01:43:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:11,558 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,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627275603] [2020-10-16 01:43:11,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:11,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:43:11,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228088871] [2020-10-16 01:43:11,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:43:11,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:43:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:43:11,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 01:43:11,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 1596 flow. Second operand 9 states. [2020-10-16 01:43:11,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:11,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 01:43:11,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:11,970 INFO L129 PetriNetUnfolder]: 207/534 cut-off events. [2020-10-16 01:43:11,971 INFO L130 PetriNetUnfolder]: For 5024/5175 co-relation queries the response was YES. [2020-10-16 01:43:11,978 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 534 events. 207/534 cut-off events. For 5024/5175 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3272 event pairs, 24 based on Foata normal form. 21/551 useless extension candidates. Maximal degree in co-relation 3460. Up to 217 conditions per place. [2020-10-16 01:43:11,981 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 63 selfloop transitions, 2 changer transitions 39/131 dead transitions. [2020-10-16 01:43:11,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 131 transitions, 1854 flow [2020-10-16 01:43:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2020-10-16 01:43:11,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6286549707602339 [2020-10-16 01:43:11,984 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2020-10-16 01:43:11,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2020-10-16 01:43:11,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:11,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2020-10-16 01:43:11,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:11,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:11,988 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:11,988 INFO L185 Difference]: Start difference. First operand has 120 places, 124 transitions, 1596 flow. Second operand 8 states and 860 transitions. [2020-10-16 01:43:11,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 131 transitions, 1854 flow [2020-10-16 01:43:12,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 131 transitions, 1759 flow, removed 28 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:12,019 INFO L241 Difference]: Finished difference. Result has 123 places, 92 transitions, 1082 flow [2020-10-16 01:43:12,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=123, PETRI_TRANSITIONS=92} [2020-10-16 01:43:12,020 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2020-10-16 01:43:12,020 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 92 transitions, 1082 flow [2020-10-16 01:43:12,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:12,020 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:12,020 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:12,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:43:12,020 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:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1750698625, now seen corresponding path program 11 times [2020-10-16 01:43:12,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:12,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603500861] [2020-10-16 01:43:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:12,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603500861] [2020-10-16 01:43:12,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:12,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:43:12,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773874739] [2020-10-16 01:43:12,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:43:12,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:43:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:43:12,237 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 01:43:12,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 92 transitions, 1082 flow. Second operand 8 states. [2020-10-16 01:43:12,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:12,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 01:43:12,239 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:12,572 INFO L129 PetriNetUnfolder]: 168/437 cut-off events. [2020-10-16 01:43:12,572 INFO L130 PetriNetUnfolder]: For 3397/3520 co-relation queries the response was YES. [2020-10-16 01:43:12,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 437 events. 168/437 cut-off events. For 3397/3520 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2572 event pairs, 18 based on Foata normal form. 35/470 useless extension candidates. Maximal degree in co-relation 2650. Up to 202 conditions per place. [2020-10-16 01:43:12,577 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 49 selfloop transitions, 12 changer transitions 14/102 dead transitions. [2020-10-16 01:43:12,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 1332 flow [2020-10-16 01:43:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2020-10-16 01:43:12,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6593567251461988 [2020-10-16 01:43:12,579 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 902 transitions. [2020-10-16 01:43:12,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions. [2020-10-16 01:43:12,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:12,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions. [2020-10-16 01:43:12,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:12,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:12,582 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:12,582 INFO L185 Difference]: Start difference. First operand has 123 places, 92 transitions, 1082 flow. Second operand 8 states and 902 transitions. [2020-10-16 01:43:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 1332 flow [2020-10-16 01:43:12,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 102 transitions, 1252 flow, removed 36 selfloop flow, removed 15 redundant places. [2020-10-16 01:43:12,604 INFO L241 Difference]: Finished difference. Result has 103 places, 87 transitions, 993 flow [2020-10-16 01:43:12,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2020-10-16 01:43:12,605 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2020-10-16 01:43:12,605 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 993 flow [2020-10-16 01:43:12,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:43:12,605 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:12,605 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:12,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:43:12,606 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:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1108348281, now seen corresponding path program 12 times [2020-10-16 01:43:12,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:12,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551607177] [2020-10-16 01:43:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:13,692 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-16 01:43:14,295 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:14,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551607177] [2020-10-16 01:43:14,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:14,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-16 01:43:14,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427881818] [2020-10-16 01:43:14,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-16 01:43:14,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-16 01:43:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-10-16 01:43:14,299 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 171 [2020-10-16 01:43:14,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 993 flow. Second operand 17 states. [2020-10-16 01:43:14,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:14,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 171 [2020-10-16 01:43:14,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:14,442 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-10-16 01:43:14,610 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-10-16 01:43:15,182 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-16 01:43:16,752 INFO L129 PetriNetUnfolder]: 329/734 cut-off events. [2020-10-16 01:43:16,752 INFO L130 PetriNetUnfolder]: For 5539/5636 co-relation queries the response was YES. [2020-10-16 01:43:16,757 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 734 events. 329/734 cut-off events. For 5539/5636 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4387 event pairs, 13 based on Foata normal form. 29/763 useless extension candidates. Maximal degree in co-relation 4732. Up to 248 conditions per place. [2020-10-16 01:43:16,761 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 53 selfloop transitions, 92 changer transitions 65/217 dead transitions. [2020-10-16 01:43:16,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 217 transitions, 2777 flow [2020-10-16 01:43:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-16 01:43:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-16 01:43:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1636 transitions. [2020-10-16 01:43:16,764 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5315139701104613 [2020-10-16 01:43:16,764 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1636 transitions. [2020-10-16 01:43:16,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1636 transitions. [2020-10-16 01:43:16,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:16,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1636 transitions. [2020-10-16 01:43:16,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-16 01:43:16,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-16 01:43:16,770 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-16 01:43:16,770 INFO L185 Difference]: Start difference. First operand has 103 places, 87 transitions, 993 flow. Second operand 18 states and 1636 transitions. [2020-10-16 01:43:16,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 217 transitions, 2777 flow [2020-10-16 01:43:16,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 217 transitions, 2738 flow, removed 5 selfloop flow, removed 7 redundant places. [2020-10-16 01:43:16,791 INFO L241 Difference]: Finished difference. Result has 120 places, 135 transitions, 1857 flow [2020-10-16 01:43:16,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1857, PETRI_PLACES=120, PETRI_TRANSITIONS=135} [2020-10-16 01:43:16,792 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 85 predicate places. [2020-10-16 01:43:16,792 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1857 flow [2020-10-16 01:43:16,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-16 01:43:16,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:16,793 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,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 01:43:16,793 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:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 681430783, now seen corresponding path program 13 times [2020-10-16 01:43:16,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:16,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115397236] [2020-10-16 01:43:16,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:17,104 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2020-10-16 01:43:17,404 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-16 01:43:17,575 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2020-10-16 01:43:17,719 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-10-16 01:43:17,896 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:17,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115397236] [2020-10-16 01:43:17,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:17,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:43:17,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776810444] [2020-10-16 01:43:17,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:43:17,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:43:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:43:17,901 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 171 [2020-10-16 01:43:17,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1857 flow. Second operand 10 states. [2020-10-16 01:43:17,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:17,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 171 [2020-10-16 01:43:17,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:18,098 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-16 01:43:18,219 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-10-16 01:43:18,876 INFO L129 PetriNetUnfolder]: 228/566 cut-off events. [2020-10-16 01:43:18,877 INFO L130 PetriNetUnfolder]: For 6755/6820 co-relation queries the response was YES. [2020-10-16 01:43:18,880 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4279 conditions, 566 events. 228/566 cut-off events. For 6755/6820 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3408 event pairs, 15 based on Foata normal form. 26/592 useless extension candidates. Maximal degree in co-relation 4232. Up to 214 conditions per place. [2020-10-16 01:43:18,883 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 36 selfloop transitions, 64 changer transitions 15/156 dead transitions. [2020-10-16 01:43:18,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 156 transitions, 2321 flow [2020-10-16 01:43:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:43:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:43:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1138 transitions. [2020-10-16 01:43:18,886 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6049973418394471 [2020-10-16 01:43:18,886 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1138 transitions. [2020-10-16 01:43:18,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1138 transitions. [2020-10-16 01:43:18,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:18,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1138 transitions. [2020-10-16 01:43:18,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:43:18,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:43:18,893 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:43:18,893 INFO L185 Difference]: Start difference. First operand has 120 places, 135 transitions, 1857 flow. Second operand 11 states and 1138 transitions. [2020-10-16 01:43:18,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 156 transitions, 2321 flow [2020-10-16 01:43:18,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 156 transitions, 2157 flow, removed 66 selfloop flow, removed 12 redundant places. [2020-10-16 01:43:18,924 INFO L241 Difference]: Finished difference. Result has 117 places, 130 transitions, 1825 flow [2020-10-16 01:43:18,925 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1825, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2020-10-16 01:43:18,925 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2020-10-16 01:43:18,925 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 1825 flow [2020-10-16 01:43:18,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:43:18,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:18,926 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:18,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 01:43:18,926 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:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash -262744447, now seen corresponding path program 14 times [2020-10-16 01:43:18,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:18,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148595918] [2020-10-16 01:43:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:19,421 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:19,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148595918] [2020-10-16 01:43:19,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:19,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 01:43:19,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569129329] [2020-10-16 01:43:19,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 01:43:19,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:19,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 01:43:19,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 01:43:19,423 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 171 [2020-10-16 01:43:19,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 1825 flow. Second operand 12 states. [2020-10-16 01:43:19,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:19,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 171 [2020-10-16 01:43:19,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:20,244 INFO L129 PetriNetUnfolder]: 361/856 cut-off events. [2020-10-16 01:43:20,244 INFO L130 PetriNetUnfolder]: For 8561/8601 co-relation queries the response was YES. [2020-10-16 01:43:20,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6416 conditions, 856 events. 361/856 cut-off events. For 8561/8601 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5544 event pairs, 30 based on Foata normal form. 11/867 useless extension candidates. Maximal degree in co-relation 6373. Up to 399 conditions per place. [2020-10-16 01:43:20,254 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 71 selfloop transitions, 26 changer transitions 87/191 dead transitions. [2020-10-16 01:43:20,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 191 transitions, 2898 flow [2020-10-16 01:43:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:43:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:43:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1125 transitions. [2020-10-16 01:43:20,258 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5980861244019139 [2020-10-16 01:43:20,258 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1125 transitions. [2020-10-16 01:43:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1125 transitions. [2020-10-16 01:43:20,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:20,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1125 transitions. [2020-10-16 01:43:20,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:43:20,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:43:20,262 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:43:20,262 INFO L185 Difference]: Start difference. First operand has 117 places, 130 transitions, 1825 flow. Second operand 11 states and 1125 transitions. [2020-10-16 01:43:20,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 191 transitions, 2898 flow [2020-10-16 01:43:20,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 191 transitions, 2611 flow, removed 52 selfloop flow, removed 14 redundant places. [2020-10-16 01:43:20,298 INFO L241 Difference]: Finished difference. Result has 112 places, 99 transitions, 1229 flow [2020-10-16 01:43:20,298 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1229, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2020-10-16 01:43:20,299 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2020-10-16 01:43:20,299 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 1229 flow [2020-10-16 01:43:20,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 01:43:20,299 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:20,299 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:20,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 01:43:20,299 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -193509297, now seen corresponding path program 15 times [2020-10-16 01:43:20,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:20,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148014975] [2020-10-16 01:43:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:20,565 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:20,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148014975] [2020-10-16 01:43:20,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:20,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:43:20,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715634292] [2020-10-16 01:43:20,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:43:20,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:43:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:43:20,569 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 171 [2020-10-16 01:43:20,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 99 transitions, 1229 flow. Second operand 9 states. [2020-10-16 01:43:20,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:20,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 171 [2020-10-16 01:43:20,570 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:21,045 INFO L129 PetriNetUnfolder]: 179/490 cut-off events. [2020-10-16 01:43:21,045 INFO L130 PetriNetUnfolder]: For 4997/5033 co-relation queries the response was YES. [2020-10-16 01:43:21,047 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 490 events. 179/490 cut-off events. For 4997/5033 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2999 event pairs, 34 based on Foata normal form. 11/500 useless extension candidates. Maximal degree in co-relation 3285. Up to 225 conditions per place. [2020-10-16 01:43:21,050 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 61 selfloop transitions, 12 changer transitions 13/122 dead transitions. [2020-10-16 01:43:21,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 122 transitions, 1646 flow [2020-10-16 01:43:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:43:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:43:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 990 transitions. [2020-10-16 01:43:21,053 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6432748538011696 [2020-10-16 01:43:21,053 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 990 transitions. [2020-10-16 01:43:21,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 990 transitions. [2020-10-16 01:43:21,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:21,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 990 transitions. [2020-10-16 01:43:21,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:43:21,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:43:21,055 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:43:21,056 INFO L185 Difference]: Start difference. First operand has 112 places, 99 transitions, 1229 flow. Second operand 9 states and 990 transitions. [2020-10-16 01:43:21,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 122 transitions, 1646 flow [2020-10-16 01:43:21,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 1486 flow, removed 26 selfloop flow, removed 15 redundant places. [2020-10-16 01:43:21,073 INFO L241 Difference]: Finished difference. Result has 102 places, 100 transitions, 1141 flow [2020-10-16 01:43:21,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1141, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2020-10-16 01:43:21,073 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2020-10-16 01:43:21,073 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 1141 flow [2020-10-16 01:43:21,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:21,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:21,074 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:21,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 01:43:21,074 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash -428792703, now seen corresponding path program 16 times [2020-10-16 01:43:21,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:21,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8718409] [2020-10-16 01:43:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:21,207 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:21,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8718409] [2020-10-16 01:43:21,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:21,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:43:21,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248484694] [2020-10-16 01:43:21,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:43:21,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:43:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:43:21,212 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 171 [2020-10-16 01:43:21,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 1141 flow. Second operand 7 states. [2020-10-16 01:43:21,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:21,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 171 [2020-10-16 01:43:21,213 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:21,549 INFO L129 PetriNetUnfolder]: 172/476 cut-off events. [2020-10-16 01:43:21,549 INFO L130 PetriNetUnfolder]: For 4264/4292 co-relation queries the response was YES. [2020-10-16 01:43:21,551 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 476 events. 172/476 cut-off events. For 4264/4292 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2870 event pairs, 36 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 3016. Up to 221 conditions per place. [2020-10-16 01:43:21,554 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 61 selfloop transitions, 8 changer transitions 9/114 dead transitions. [2020-10-16 01:43:21,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 114 transitions, 1443 flow [2020-10-16 01:43:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 935 transitions. [2020-10-16 01:43:21,557 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6834795321637427 [2020-10-16 01:43:21,557 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 935 transitions. [2020-10-16 01:43:21,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 935 transitions. [2020-10-16 01:43:21,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:21,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 935 transitions. [2020-10-16 01:43:21,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:21,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:21,561 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:21,561 INFO L185 Difference]: Start difference. First operand has 102 places, 100 transitions, 1141 flow. Second operand 8 states and 935 transitions. [2020-10-16 01:43:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 114 transitions, 1443 flow [2020-10-16 01:43:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 114 transitions, 1357 flow, removed 22 selfloop flow, removed 7 redundant places. [2020-10-16 01:43:21,579 INFO L241 Difference]: Finished difference. Result has 104 places, 99 transitions, 1082 flow [2020-10-16 01:43:21,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2020-10-16 01:43:21,580 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2020-10-16 01:43:21,580 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 1082 flow [2020-10-16 01:43:21,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:43:21,580 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:21,580 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:21,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 01:43:21,581 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1473909281, now seen corresponding path program 17 times [2020-10-16 01:43:21,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:21,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000150474] [2020-10-16 01:43:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:22,051 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2020-10-16 01:43:22,102 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:22,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000150474] [2020-10-16 01:43:22,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:22,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:43:22,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516566948] [2020-10-16 01:43:22,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:43:22,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:43:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:43:22,105 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 171 [2020-10-16 01:43:22,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 1082 flow. Second operand 10 states. [2020-10-16 01:43:22,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:22,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 171 [2020-10-16 01:43:22,106 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:22,737 INFO L129 PetriNetUnfolder]: 166/445 cut-off events. [2020-10-16 01:43:22,737 INFO L130 PetriNetUnfolder]: For 3648/3671 co-relation queries the response was YES. [2020-10-16 01:43:22,739 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 445 events. 166/445 cut-off events. For 3648/3671 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2586 event pairs, 30 based on Foata normal form. 8/451 useless extension candidates. Maximal degree in co-relation 2736. Up to 208 conditions per place. [2020-10-16 01:43:22,740 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 49 selfloop transitions, 3 changer transitions 17/105 dead transitions. [2020-10-16 01:43:22,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 1285 flow [2020-10-16 01:43:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:43:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:43:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 951 transitions. [2020-10-16 01:43:22,742 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6179337231968811 [2020-10-16 01:43:22,742 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 951 transitions. [2020-10-16 01:43:22,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 951 transitions. [2020-10-16 01:43:22,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:22,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 951 transitions. [2020-10-16 01:43:22,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:43:22,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:43:22,745 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:43:22,745 INFO L185 Difference]: Start difference. First operand has 104 places, 99 transitions, 1082 flow. Second operand 9 states and 951 transitions. [2020-10-16 01:43:22,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 1285 flow [2020-10-16 01:43:22,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 1241 flow, removed 5 selfloop flow, removed 8 redundant places. [2020-10-16 01:43:22,756 INFO L241 Difference]: Finished difference. Result has 103 places, 88 transitions, 899 flow [2020-10-16 01:43:22,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=899, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2020-10-16 01:43:22,757 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2020-10-16 01:43:22,757 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 899 flow [2020-10-16 01:43:22,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:43:22,757 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:22,757 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:22,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 01:43:22,757 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1536328201, now seen corresponding path program 18 times [2020-10-16 01:43:22,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:22,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775254994] [2020-10-16 01:43:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:23,137 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 26 [2020-10-16 01:43:23,621 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:23,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775254994] [2020-10-16 01:43:23,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:23,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 01:43:23,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90360917] [2020-10-16 01:43:23,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 01:43:23,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 01:43:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-16 01:43:23,624 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 171 [2020-10-16 01:43:23,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 88 transitions, 899 flow. Second operand 12 states. [2020-10-16 01:43:23,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:23,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 171 [2020-10-16 01:43:23,625 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:24,152 INFO L129 PetriNetUnfolder]: 153/399 cut-off events. [2020-10-16 01:43:24,152 INFO L130 PetriNetUnfolder]: For 3261/3284 co-relation queries the response was YES. [2020-10-16 01:43:24,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 399 events. 153/399 cut-off events. For 3261/3284 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2226 event pairs, 13 based on Foata normal form. 9/406 useless extension candidates. Maximal degree in co-relation 2418. Up to 185 conditions per place. [2020-10-16 01:43:24,155 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 22 selfloop transitions, 14 changer transitions 33/97 dead transitions. [2020-10-16 01:43:24,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 1114 flow [2020-10-16 01:43:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:43:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:43:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2020-10-16 01:43:24,157 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6148705096073517 [2020-10-16 01:43:24,157 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2020-10-16 01:43:24,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2020-10-16 01:43:24,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:24,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2020-10-16 01:43:24,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:43:24,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:43:24,160 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:43:24,160 INFO L185 Difference]: Start difference. First operand has 103 places, 88 transitions, 899 flow. Second operand 7 states and 736 transitions. [2020-10-16 01:43:24,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 1114 flow [2020-10-16 01:43:24,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 97 transitions, 1053 flow, removed 17 selfloop flow, removed 12 redundant places. [2020-10-16 01:43:24,170 INFO L241 Difference]: Finished difference. Result has 89 places, 61 transitions, 585 flow [2020-10-16 01:43:24,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=89, PETRI_TRANSITIONS=61} [2020-10-16 01:43:24,171 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2020-10-16 01:43:24,171 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 61 transitions, 585 flow [2020-10-16 01:43:24,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 01:43:24,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:24,171 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:24,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 01:43:24,171 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -575564965, now seen corresponding path program 19 times [2020-10-16 01:43:24,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:24,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187084665] [2020-10-16 01:43:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:43:24,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:43:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:43:24,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:43:24,398 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:43:24,398 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:43:24,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 01:43:24,439 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:24,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,447 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:24,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,447 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:24,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,448 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:24,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,449 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:24,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,450 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:24,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,450 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:24,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,451 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:24,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,452 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:24,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,452 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:24,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,453 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:24,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,453 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:24,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,454 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:24,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,454 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:24,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,455 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:24,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,455 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:24,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,456 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:24,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,461 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:24,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,461 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:24,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,461 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:24,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,462 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:24,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,462 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:24,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,463 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:24,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,464 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:24,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,464 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:24,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,465 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:24,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,465 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:24,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,466 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:24,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,467 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:24,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,467 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:24,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,468 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:24,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,469 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:24,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,469 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:24,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,470 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:24,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,470 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:24,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,471 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:24,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,471 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:24,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,472 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:24,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,472 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:24,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,473 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:24,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,473 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:24,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,474 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:24,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,474 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:24,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,475 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:24,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,476 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:24,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,477 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:24,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,477 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:24,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,478 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:24,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,478 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:24,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,479 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:24,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,480 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:24,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,480 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:24,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,481 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:24,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,481 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:24,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,482 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:24,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,482 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:24,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,482 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:24,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,483 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:24,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,483 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:24,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,484 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:24,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,484 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:24,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,485 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:24,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:24,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:43:24 BasicIcfg [2020-10-16 01:43:24,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:43:24,615 INFO L168 Benchmark]: Toolchain (without parser) took 40458.34 ms. Allocated memory was 251.1 MB in the beginning and 997.2 MB in the end (delta: 746.1 MB). Free memory was 205.7 MB in the beginning and 606.0 MB in the end (delta: -400.3 MB). Peak memory consumption was 345.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,616 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:43:24,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.96 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.7 MB in the beginning and 260.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 314.6 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,618 INFO L168 Benchmark]: Boogie Preprocessor took 78.77 ms. Allocated memory is still 314.6 MB. Free memory was 257.9 MB in the beginning and 255.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,618 INFO L168 Benchmark]: RCFGBuilder took 4035.13 ms. Allocated memory was 314.6 MB in the beginning and 429.4 MB in the end (delta: 114.8 MB). Free memory was 255.4 MB in the beginning and 358.3 MB in the end (delta: -103.0 MB). Peak memory consumption was 158.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,619 INFO L168 Benchmark]: TraceAbstraction took 35439.83 ms. Allocated memory was 429.4 MB in the beginning and 997.2 MB in the end (delta: 567.8 MB). Free memory was 358.3 MB in the beginning and 606.0 MB in the end (delta: -247.7 MB). Peak memory consumption was 320.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:24,629 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.47 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 822.96 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.7 MB in the beginning and 260.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 314.6 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 78.77 ms. Allocated memory is still 314.6 MB. Free memory was 257.9 MB in the beginning and 255.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 4035.13 ms. Allocated memory was 314.6 MB in the beginning and 429.4 MB in the end (delta: 114.8 MB). Free memory was 255.4 MB in the beginning and 358.3 MB in the end (delta: -103.0 MB). Peak memory consumption was 158.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 35439.83 ms. Allocated memory was 429.4 MB in the beginning and 997.2 MB in the end (delta: 567.8 MB). Free memory was 358.3 MB in the beginning and 606.0 MB in the end (delta: -247.7 MB). Peak memory consumption was 320.2 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.4s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 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 t2330; [L844] FCALL, FORK 0 pthread_create(&t2330, ((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 t2331; [L846] FCALL, FORK 0 pthread_create(&t2331, ((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 t2332; [L848] FCALL, FORK 0 pthread_create(&t2332, ((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=2, 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=2, 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=1, weak$$choice2=0, 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 [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; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 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=3, weak$$choice2=0, 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=3, weak$$choice2=0, 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: 35.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 158 SDtfs, 253 SDslu, 404 SDs, 0 SdLazy, 3415 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1857occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 190123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...