/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:55:40,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:55:40,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:55:40,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:55:40,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:55:40,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:55:40,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:55:40,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:55:40,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:55:40,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:55:40,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:55:40,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:55:40,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:55:40,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:55:40,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:55:40,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:55:40,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:55:40,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:55:40,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:55:40,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:55:40,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:55:40,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:55:40,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:55:40,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:55:40,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:55:40,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:55:40,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:55:40,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:55:40,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:55:40,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:55:40,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:55:40,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:55:40,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:55:40,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:55:40,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:55:40,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:55:40,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:55:40,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:55:40,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:55:40,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:55:40,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:55:40,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:55:40,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:55:40,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:55:40,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:55:40,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:55:40,876 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:55:40,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:55:40,876 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:55:40,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:55:40,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:55:40,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:55:40,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:55:40,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:55:40,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:55:40,877 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:55:40,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:55:40,878 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:55:40,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:55:40,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:55:40,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:55:40,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:55:40,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:55:40,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:55:40,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:55:40,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:55:40,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:55:40,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:55:40,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:55:40,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:55:40,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:55:41,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:55:41,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:55:41,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:55:41,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:55:41,179 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:55:41,180 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-16 04:55:41,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64335ead/eceadafe07aa4b96810273df6ff68472/FLAGe68ab555f [2020-10-16 04:55:41,817 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:55:41,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-16 04:55:41,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64335ead/eceadafe07aa4b96810273df6ff68472/FLAGe68ab555f [2020-10-16 04:55:42,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64335ead/eceadafe07aa4b96810273df6ff68472 [2020-10-16 04:55:42,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:55:42,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:55:42,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:55:42,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:55:42,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:55:42,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d743a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42, skipping insertion in model container [2020-10-16 04:55:42,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:55:42,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:55:42,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:55:42,736 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:55:42,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:55:42,868 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:55:42,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42 WrapperNode [2020-10-16 04:55:42,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:55:42,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:55:42,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:55:42,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:55:42,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:55:42,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:55:42,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:55:42,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:55:42,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (1/1) ... [2020-10-16 04:55:42,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:55:42,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:55:42,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:55:42,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:55:42,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (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 04:55:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:55:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:55:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:55:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:55:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:55:43,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:55:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:55:43,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:55:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:55:43,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:55:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:55:43,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:55:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:55:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:55:43,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:55:43,074 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 04:55:45,124 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:55:45,125 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:55:45,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:55:45 BoogieIcfgContainer [2020-10-16 04:55:45,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:55:45,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:55:45,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:55:45,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:55:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:55:42" (1/3) ... [2020-10-16 04:55:45,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b75f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:55:45, skipping insertion in model container [2020-10-16 04:55:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:42" (2/3) ... [2020-10-16 04:55:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b75f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:55:45, skipping insertion in model container [2020-10-16 04:55:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:55:45" (3/3) ... [2020-10-16 04:55:45,136 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-10-16 04:55:45,148 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:55:45,156 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:55:45,157 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:55:45,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,191 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,191 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,196 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,196 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,197 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,197 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,204 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,205 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,210 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,211 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,212 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:55:45,234 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:55:45,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:55:45,257 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:55:45,257 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:55:45,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:55:45,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:55:45,258 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:55:45,258 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:55:45,258 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:55:45,273 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 04:55:45,323 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 04:55:45,323 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:55:45,329 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 04:55:45,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 04:55:45,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow [2020-10-16 04:55:45,339 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:55:45,341 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 04:55:45,345 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 04:55:45,345 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 103 transitions, 218 flow [2020-10-16 04:55:45,375 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 04:55:45,376 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:55:45,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 04:55:45,381 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 04:55:45,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:45,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:45,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:45,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:45,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:45,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:45,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:45,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:45,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:45,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:45,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:45,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:45,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:45,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:45,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:45,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:45,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:55:45,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:45,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:55:45,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:45,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:55:45,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:45,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:55:45,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:46,952 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:55:46,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:55:46,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:46,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:55:46,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:48,224 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:55:48,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:55:48,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:48,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:48,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:48,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:48,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:49,215 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:55:49,319 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:55:49,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:49,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:49,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:49,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:49,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:49,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:49,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:49,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:49,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:49,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:49,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:49,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:49,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:49,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:49,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:49,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:49,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:50,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:50,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:50,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:50,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:50,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:50,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:50,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:50,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:50,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:50,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:50,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:50,814 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 04:55:51,210 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 04:55:51,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:51,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:51,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:51,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:51,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:51,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:51,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:51,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:51,710 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:55:52,786 WARN L193 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 04:55:53,161 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 04:55:53,818 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-10-16 04:55:54,166 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 04:55:54,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:55:54,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:55:54,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:54,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:54,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:55:54,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:54,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:55:54,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:54,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:55:54,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:55:54,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:55,315 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 04:55:55,893 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-16 04:55:56,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:56,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:56,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:56,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:56,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:56,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:56,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:56,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:56,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:56,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:55:56,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:55:56,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:55:56,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:56,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:55:56,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:55:56,441 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 04:55:56,601 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:55:56,647 INFO L132 LiptonReduction]: Checked pairs total: 6523 [2020-10-16 04:55:56,648 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 04:55:56,651 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11314 [2020-10-16 04:55:56,659 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2020-10-16 04:55:56,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:55:56,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:56,661 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:56,661 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 04:55:56,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:56,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141746247] [2020-10-16 04:55:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:56,968 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 04:55:56,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141746247] [2020-10-16 04:55:56,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:56,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:55:56,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944964928] [2020-10-16 04:55:56,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:55:56,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:55:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:55:57,001 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2020-10-16 04:55:57,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states. [2020-10-16 04:55:57,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:57,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2020-10-16 04:55:57,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:57,086 INFO L129 PetriNetUnfolder]: 23/69 cut-off events. [2020-10-16 04:55:57,087 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:55:57,087 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 23/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 9 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 119. Up to 37 conditions per place. [2020-10-16 04:55:57,089 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 7 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 04:55:57,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 94 flow [2020-10-16 04:55:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:55:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:55:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2020-10-16 04:55:57,107 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8487972508591065 [2020-10-16 04:55:57,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2020-10-16 04:55:57,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2020-10-16 04:55:57,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:57,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2020-10-16 04:55:57,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:55:57,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:55:57,128 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:55:57,131 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 494 transitions. [2020-10-16 04:55:57,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 94 flow [2020-10-16 04:55:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:55:57,135 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2020-10-16 04:55:57,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2020-10-16 04:55:57,139 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 04:55:57,139 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2020-10-16 04:55:57,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:55:57,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:57,139 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:57,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:55:57,140 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 440307498, now seen corresponding path program 1 times [2020-10-16 04:55:57,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:57,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235592753] [2020-10-16 04:55:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:57,263 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 04:55:57,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235592753] [2020-10-16 04:55:57,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:57,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:55:57,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644965745] [2020-10-16 04:55:57,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:55:57,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:55:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:55:57,268 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 04:55:57,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states. [2020-10-16 04:55:57,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:57,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 04:55:57,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:57,287 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2020-10-16 04:55:57,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:55:57,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2020-10-16 04:55:57,288 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 04:55:57,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 78 flow [2020-10-16 04:55:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:55:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:55:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-16 04:55:57,293 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625429553264605 [2020-10-16 04:55:57,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-16 04:55:57,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-16 04:55:57,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:57,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-16 04:55:57,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:55:57,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:55:57,298 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:55:57,298 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 502 transitions. [2020-10-16 04:55:57,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 78 flow [2020-10-16 04:55:57,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:55:57,299 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2020-10-16 04:55:57,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2020-10-16 04:55:57,300 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 04:55:57,300 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2020-10-16 04:55:57,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:55:57,301 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:57,301 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:57,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:55:57,301 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 764630339, now seen corresponding path program 1 times [2020-10-16 04:55:57,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:57,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692629562] [2020-10-16 04:55:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:57,379 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 04:55:57,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692629562] [2020-10-16 04:55:57,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:57,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:55:57,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752797790] [2020-10-16 04:55:57,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:55:57,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:55:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:55:57,383 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 04:55:57,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states. [2020-10-16 04:55:57,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:57,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 04:55:57,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:57,495 INFO L129 PetriNetUnfolder]: 195/378 cut-off events. [2020-10-16 04:55:57,495 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-16 04:55:57,498 INFO L80 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 378 events. 195/378 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1866 event pairs, 112 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 739. Up to 267 conditions per place. [2020-10-16 04:55:57,502 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2020-10-16 04:55:57,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 113 flow [2020-10-16 04:55:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:55:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:55:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2020-10-16 04:55:57,505 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7920962199312714 [2020-10-16 04:55:57,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2020-10-16 04:55:57,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2020-10-16 04:55:57,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:57,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2020-10-16 04:55:57,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:55:57,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:55:57,509 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:55:57,509 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 461 transitions. [2020-10-16 04:55:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 113 flow [2020-10-16 04:55:57,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:57,511 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 100 flow [2020-10-16 04:55:57,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2020-10-16 04:55:57,511 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2020-10-16 04:55:57,511 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 100 flow [2020-10-16 04:55:57,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:55:57,511 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:57,512 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:57,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:55:57,512 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2069270506, now seen corresponding path program 1 times [2020-10-16 04:55:57,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:57,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450710502] [2020-10-16 04:55:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:57,622 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 04:55:57,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450710502] [2020-10-16 04:55:57,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:57,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:55:57,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572477861] [2020-10-16 04:55:57,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:55:57,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:57,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:55:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:55:57,626 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 194 [2020-10-16 04:55:57,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 100 flow. Second operand 4 states. [2020-10-16 04:55:57,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:57,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 194 [2020-10-16 04:55:57,627 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:57,734 INFO L129 PetriNetUnfolder]: 198/393 cut-off events. [2020-10-16 04:55:57,735 INFO L130 PetriNetUnfolder]: For 137/146 co-relation queries the response was YES. [2020-10-16 04:55:57,737 INFO L80 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 393 events. 198/393 cut-off events. For 137/146 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2004 event pairs, 95 based on Foata normal form. 8/370 useless extension candidates. Maximal degree in co-relation 854. Up to 216 conditions per place. [2020-10-16 04:55:57,741 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2020-10-16 04:55:57,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 149 flow [2020-10-16 04:55:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:55:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:55:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2020-10-16 04:55:57,745 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7822164948453608 [2020-10-16 04:55:57,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2020-10-16 04:55:57,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2020-10-16 04:55:57,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:57,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2020-10-16 04:55:57,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:55:57,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:55:57,749 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:55:57,749 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 100 flow. Second operand 4 states and 607 transitions. [2020-10-16 04:55:57,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 149 flow [2020-10-16 04:55:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:57,752 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 142 flow [2020-10-16 04:55:57,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2020-10-16 04:55:57,752 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2020-10-16 04:55:57,753 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 142 flow [2020-10-16 04:55:57,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:55:57,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:57,753 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:57,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:55:57,753 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -543965711, now seen corresponding path program 1 times [2020-10-16 04:55:57,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:57,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240820050] [2020-10-16 04:55:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:57,891 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 04:55:57,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240820050] [2020-10-16 04:55:57,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:57,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:55:57,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915892664] [2020-10-16 04:55:57,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:55:57,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:55:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:55:57,894 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2020-10-16 04:55:57,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 142 flow. Second operand 5 states. [2020-10-16 04:55:57,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:57,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2020-10-16 04:55:57,895 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:58,036 INFO L129 PetriNetUnfolder]: 180/371 cut-off events. [2020-10-16 04:55:58,036 INFO L130 PetriNetUnfolder]: For 411/417 co-relation queries the response was YES. [2020-10-16 04:55:58,038 INFO L80 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 371 events. 180/371 cut-off events. For 411/417 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1929 event pairs, 28 based on Foata normal form. 9/353 useless extension candidates. Maximal degree in co-relation 976. Up to 191 conditions per place. [2020-10-16 04:55:58,041 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 9 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2020-10-16 04:55:58,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 200 flow [2020-10-16 04:55:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:55:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:55:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2020-10-16 04:55:58,045 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7925257731958762 [2020-10-16 04:55:58,045 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2020-10-16 04:55:58,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2020-10-16 04:55:58,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:58,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2020-10-16 04:55:58,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:55:58,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:55:58,049 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:55:58,049 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 142 flow. Second operand 4 states and 615 transitions. [2020-10-16 04:55:58,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 200 flow [2020-10-16 04:55:58,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:55:58,053 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 199 flow [2020-10-16 04:55:58,053 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2020-10-16 04:55:58,053 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2020-10-16 04:55:58,053 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 199 flow [2020-10-16 04:55:58,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:55:58,054 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:58,054 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:58,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:55:58,054 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -311170623, now seen corresponding path program 1 times [2020-10-16 04:55:58,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:58,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891824811] [2020-10-16 04:55:58,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:55:58,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891824811] [2020-10-16 04:55:58,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:58,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:55:58,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260061971] [2020-10-16 04:55:58,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:55:58,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:55:58,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:55:58,100 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 04:55:58,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 199 flow. Second operand 3 states. [2020-10-16 04:55:58,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:58,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 04:55:58,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:58,155 INFO L129 PetriNetUnfolder]: 105/266 cut-off events. [2020-10-16 04:55:58,155 INFO L130 PetriNetUnfolder]: For 701/726 co-relation queries the response was YES. [2020-10-16 04:55:58,157 INFO L80 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 266 events. 105/266 cut-off events. For 701/726 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1436 event pairs, 40 based on Foata normal form. 8/246 useless extension candidates. Maximal degree in co-relation 816. Up to 94 conditions per place. [2020-10-16 04:55:58,159 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2020-10-16 04:55:58,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 223 flow [2020-10-16 04:55:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:55:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:55:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-16 04:55:58,162 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625429553264605 [2020-10-16 04:55:58,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-16 04:55:58,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-16 04:55:58,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:58,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-16 04:55:58,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:55:58,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:55:58,166 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:55:58,166 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 199 flow. Second operand 3 states and 502 transitions. [2020-10-16 04:55:58,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 223 flow [2020-10-16 04:55:58,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 212 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:58,170 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 217 flow [2020-10-16 04:55:58,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2020-10-16 04:55:58,171 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2020-10-16 04:55:58,171 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 217 flow [2020-10-16 04:55:58,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:55:58,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:58,171 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:58,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:55:58,172 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1406096363, now seen corresponding path program 1 times [2020-10-16 04:55:58,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:58,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476125846] [2020-10-16 04:55:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:55:58,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476125846] [2020-10-16 04:55:58,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:58,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:55:58,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070547302] [2020-10-16 04:55:58,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:55:58,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:55:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:55:58,252 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 04:55:58,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 217 flow. Second operand 5 states. [2020-10-16 04:55:58,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:58,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 04:55:58,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:58,447 INFO L129 PetriNetUnfolder]: 205/426 cut-off events. [2020-10-16 04:55:58,447 INFO L130 PetriNetUnfolder]: For 1062/1087 co-relation queries the response was YES. [2020-10-16 04:55:58,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 426 events. 205/426 cut-off events. For 1062/1087 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2307 event pairs, 43 based on Foata normal form. 8/404 useless extension candidates. Maximal degree in co-relation 1449. Up to 220 conditions per place. [2020-10-16 04:55:58,458 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 10 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2020-10-16 04:55:58,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 305 flow [2020-10-16 04:55:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:55:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:55:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2020-10-16 04:55:58,464 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7845360824742268 [2020-10-16 04:55:58,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 761 transitions. [2020-10-16 04:55:58,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions. [2020-10-16 04:55:58,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:58,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions. [2020-10-16 04:55:58,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:55:58,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:55:58,471 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:55:58,471 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 217 flow. Second operand 5 states and 761 transitions. [2020-10-16 04:55:58,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 305 flow [2020-10-16 04:55:58,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 296 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:58,480 INFO L241 Difference]: Finished difference. Result has 55 places, 47 transitions, 297 flow [2020-10-16 04:55:58,480 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2020-10-16 04:55:58,481 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2020-10-16 04:55:58,481 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 297 flow [2020-10-16 04:55:58,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:55:58,481 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:58,482 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:58,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:55:58,482 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash 319634357, now seen corresponding path program 2 times [2020-10-16 04:55:58,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:58,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839207648] [2020-10-16 04:55:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:58,682 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 04:55:58,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839207648] [2020-10-16 04:55:58,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:58,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:55:58,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959503866] [2020-10-16 04:55:58,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:55:58,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:55:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:55:58,686 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 04:55:58,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 297 flow. Second operand 5 states. [2020-10-16 04:55:58,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:58,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 04:55:58,687 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:58,827 INFO L129 PetriNetUnfolder]: 180/401 cut-off events. [2020-10-16 04:55:58,827 INFO L130 PetriNetUnfolder]: For 1427/1459 co-relation queries the response was YES. [2020-10-16 04:55:58,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 401 events. 180/401 cut-off events. For 1427/1459 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2266 event pairs, 42 based on Foata normal form. 22/395 useless extension candidates. Maximal degree in co-relation 1569. Up to 181 conditions per place. [2020-10-16 04:55:58,835 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 16 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2020-10-16 04:55:58,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 368 flow [2020-10-16 04:55:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:55:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:55:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2020-10-16 04:55:58,839 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7835051546391752 [2020-10-16 04:55:58,839 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 608 transitions. [2020-10-16 04:55:58,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 608 transitions. [2020-10-16 04:55:58,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:58,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 608 transitions. [2020-10-16 04:55:58,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:55:58,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:55:58,843 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:55:58,843 INFO L185 Difference]: Start difference. First operand has 55 places, 47 transitions, 297 flow. Second operand 4 states and 608 transitions. [2020-10-16 04:55:58,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 368 flow [2020-10-16 04:55:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 363 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:58,851 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 325 flow [2020-10-16 04:55:58,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2020-10-16 04:55:58,852 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2020-10-16 04:55:58,852 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 325 flow [2020-10-16 04:55:58,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:55:58,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:58,852 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:58,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:55:58,852 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1119448353, now seen corresponding path program 1 times [2020-10-16 04:55:58,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:58,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377306460] [2020-10-16 04:55:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:58,931 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 04:55:58,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377306460] [2020-10-16 04:55:58,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:58,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:55:58,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941878324] [2020-10-16 04:55:58,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:55:58,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:55:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:55:58,935 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 04:55:58,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 325 flow. Second operand 3 states. [2020-10-16 04:55:58,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:58,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 04:55:58,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:59,010 INFO L129 PetriNetUnfolder]: 127/366 cut-off events. [2020-10-16 04:55:59,010 INFO L130 PetriNetUnfolder]: For 2018/2139 co-relation queries the response was YES. [2020-10-16 04:55:59,013 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 366 events. 127/366 cut-off events. For 2018/2139 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2312 event pairs, 23 based on Foata normal form. 18/353 useless extension candidates. Maximal degree in co-relation 1440. Up to 126 conditions per place. [2020-10-16 04:55:59,016 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2020-10-16 04:55:59,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 337 flow [2020-10-16 04:55:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:55:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:55:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2020-10-16 04:55:59,020 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2020-10-16 04:55:59,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2020-10-16 04:55:59,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2020-10-16 04:55:59,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:59,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2020-10-16 04:55:59,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:55:59,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:55:59,024 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:55:59,024 INFO L185 Difference]: Start difference. First operand has 58 places, 48 transitions, 325 flow. Second operand 3 states and 501 transitions. [2020-10-16 04:55:59,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 337 flow [2020-10-16 04:55:59,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 317 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:55:59,031 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 316 flow [2020-10-16 04:55:59,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2020-10-16 04:55:59,031 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2020-10-16 04:55:59,031 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 316 flow [2020-10-16 04:55:59,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:55:59,031 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:59,032 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:55:59,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:55:59,032 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1612252006, now seen corresponding path program 1 times [2020-10-16 04:55:59,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:59,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521721218] [2020-10-16 04:55:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:55:59,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521721218] [2020-10-16 04:55:59,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:59,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:55:59,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217688407] [2020-10-16 04:55:59,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:55:59,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:59,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:55:59,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:55:59,247 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 04:55:59,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 316 flow. Second operand 6 states. [2020-10-16 04:55:59,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:59,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 04:55:59,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:55:59,432 INFO L129 PetriNetUnfolder]: 166/421 cut-off events. [2020-10-16 04:55:59,432 INFO L130 PetriNetUnfolder]: For 1708/1776 co-relation queries the response was YES. [2020-10-16 04:55:59,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 421 events. 166/421 cut-off events. For 1708/1776 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2559 event pairs, 15 based on Foata normal form. 12/401 useless extension candidates. Maximal degree in co-relation 1827. Up to 220 conditions per place. [2020-10-16 04:55:59,440 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 16 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2020-10-16 04:55:59,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 400 flow [2020-10-16 04:55:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:55:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:55:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2020-10-16 04:55:59,445 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7494845360824742 [2020-10-16 04:55:59,445 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2020-10-16 04:55:59,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2020-10-16 04:55:59,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:55:59,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2020-10-16 04:55:59,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:55:59,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:55:59,450 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:55:59,450 INFO L185 Difference]: Start difference. First operand has 58 places, 48 transitions, 316 flow. Second operand 5 states and 727 transitions. [2020-10-16 04:55:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 400 flow [2020-10-16 04:55:59,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 395 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:55:59,456 INFO L241 Difference]: Finished difference. Result has 62 places, 49 transitions, 351 flow [2020-10-16 04:55:59,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2020-10-16 04:55:59,457 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2020-10-16 04:55:59,458 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 351 flow [2020-10-16 04:55:59,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:55:59,458 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:55:59,458 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 04:55:59,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:55:59,458 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:55:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:55:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash -106504832, now seen corresponding path program 1 times [2020-10-16 04:55:59,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:55:59,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946149423] [2020-10-16 04:55:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:55:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:55:59,551 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 04:55:59,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946149423] [2020-10-16 04:55:59,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:55:59,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:55:59,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653078489] [2020-10-16 04:55:59,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:55:59,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:55:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:55:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:55:59,555 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 194 [2020-10-16 04:55:59,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 351 flow. Second operand 6 states. [2020-10-16 04:55:59,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:55:59,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 194 [2020-10-16 04:55:59,557 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:00,232 INFO L129 PetriNetUnfolder]: 2037/3653 cut-off events. [2020-10-16 04:56:00,232 INFO L130 PetriNetUnfolder]: For 21644/22336 co-relation queries the response was YES. [2020-10-16 04:56:00,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11460 conditions, 3653 events. 2037/3653 cut-off events. For 21644/22336 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 27839 event pairs, 214 based on Foata normal form. 211/3553 useless extension candidates. Maximal degree in co-relation 11433. Up to 1244 conditions per place. [2020-10-16 04:56:00,287 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 23 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2020-10-16 04:56:00,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 549 flow [2020-10-16 04:56:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:56:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:56:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1105 transitions. [2020-10-16 04:56:00,291 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8136966126656848 [2020-10-16 04:56:00,292 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1105 transitions. [2020-10-16 04:56:00,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1105 transitions. [2020-10-16 04:56:00,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:00,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1105 transitions. [2020-10-16 04:56:00,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:56:00,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:56:00,299 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:56:00,299 INFO L185 Difference]: Start difference. First operand has 62 places, 49 transitions, 351 flow. Second operand 7 states and 1105 transitions. [2020-10-16 04:56:00,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 549 flow [2020-10-16 04:56:00,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 527 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:56:00,317 INFO L241 Difference]: Finished difference. Result has 70 places, 63 transitions, 446 flow [2020-10-16 04:56:00,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2020-10-16 04:56:00,318 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2020-10-16 04:56:00,318 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 446 flow [2020-10-16 04:56:00,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:56:00,318 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:00,318 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:00,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:56:00,319 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1123821802, now seen corresponding path program 2 times [2020-10-16 04:56:00,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:00,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350302918] [2020-10-16 04:56:00,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:00,420 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 04:56:00,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350302918] [2020-10-16 04:56:00,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:00,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:56:00,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446342717] [2020-10-16 04:56:00,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:56:00,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:56:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:56:00,424 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194 [2020-10-16 04:56:00,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 446 flow. Second operand 6 states. [2020-10-16 04:56:00,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:00,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194 [2020-10-16 04:56:00,425 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:01,020 INFO L129 PetriNetUnfolder]: 1452/2839 cut-off events. [2020-10-16 04:56:01,021 INFO L130 PetriNetUnfolder]: For 17138/18582 co-relation queries the response was YES. [2020-10-16 04:56:01,054 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12302 conditions, 2839 events. 1452/2839 cut-off events. For 17138/18582 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 22896 event pairs, 356 based on Foata normal form. 188/2634 useless extension candidates. Maximal degree in co-relation 12270. Up to 1670 conditions per place. [2020-10-16 04:56:01,085 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 15 selfloop transitions, 17 changer transitions 0/70 dead transitions. [2020-10-16 04:56:01,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 584 flow [2020-10-16 04:56:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:56:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:56:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2020-10-16 04:56:01,089 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7536082474226804 [2020-10-16 04:56:01,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2020-10-16 04:56:01,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2020-10-16 04:56:01,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:01,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2020-10-16 04:56:01,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:56:01,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:56:01,096 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:56:01,096 INFO L185 Difference]: Start difference. First operand has 70 places, 63 transitions, 446 flow. Second operand 5 states and 731 transitions. [2020-10-16 04:56:01,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 584 flow [2020-10-16 04:56:01,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:56:01,120 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 580 flow [2020-10-16 04:56:01,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=580, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2020-10-16 04:56:01,120 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2020-10-16 04:56:01,121 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 580 flow [2020-10-16 04:56:01,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:56:01,121 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:01,121 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:01,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:56:01,122 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1647770566, now seen corresponding path program 3 times [2020-10-16 04:56:01,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:01,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283309810] [2020-10-16 04:56:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:01,345 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 04:56:01,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283309810] [2020-10-16 04:56:01,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:01,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:56:01,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035570464] [2020-10-16 04:56:01,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:56:01,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:56:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:56:01,350 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 04:56:01,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 580 flow. Second operand 6 states. [2020-10-16 04:56:01,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:01,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 04:56:01,351 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:01,909 INFO L129 PetriNetUnfolder]: 1126/2294 cut-off events. [2020-10-16 04:56:01,909 INFO L130 PetriNetUnfolder]: For 24871/27183 co-relation queries the response was YES. [2020-10-16 04:56:01,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10158 conditions, 2294 events. 1126/2294 cut-off events. For 24871/27183 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 18916 event pairs, 249 based on Foata normal form. 296/2259 useless extension candidates. Maximal degree in co-relation 10122. Up to 1267 conditions per place. [2020-10-16 04:56:01,949 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 15 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2020-10-16 04:56:01,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 652 flow [2020-10-16 04:56:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:56:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:56:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 868 transitions. [2020-10-16 04:56:01,954 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2020-10-16 04:56:01,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 868 transitions. [2020-10-16 04:56:01,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 868 transitions. [2020-10-16 04:56:01,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:01,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 868 transitions. [2020-10-16 04:56:01,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:56:01,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:56:01,960 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:56:01,960 INFO L185 Difference]: Start difference. First operand has 76 places, 69 transitions, 580 flow. Second operand 6 states and 868 transitions. [2020-10-16 04:56:01,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 652 flow [2020-10-16 04:56:01,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 633 flow, removed 9 selfloop flow, removed 1 redundant places. [2020-10-16 04:56:01,980 INFO L241 Difference]: Finished difference. Result has 81 places, 68 transitions, 591 flow [2020-10-16 04:56:01,981 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2020-10-16 04:56:01,981 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2020-10-16 04:56:01,981 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 591 flow [2020-10-16 04:56:01,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:56:01,981 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:01,981 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:01,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:56:01,982 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 958494854, now seen corresponding path program 1 times [2020-10-16 04:56:01,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:01,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400703256] [2020-10-16 04:56:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:02,029 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 04:56:02,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400703256] [2020-10-16 04:56:02,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:02,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:56:02,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744034673] [2020-10-16 04:56:02,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:56:02,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:56:02,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:56:02,032 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 04:56:02,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 591 flow. Second operand 4 states. [2020-10-16 04:56:02,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:02,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 04:56:02,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:02,860 INFO L129 PetriNetUnfolder]: 2472/4700 cut-off events. [2020-10-16 04:56:02,860 INFO L130 PetriNetUnfolder]: For 28190/32875 co-relation queries the response was YES. [2020-10-16 04:56:02,903 INFO L80 FinitePrefix]: Finished finitePrefix Result has 22888 conditions, 4700 events. 2472/4700 cut-off events. For 28190/32875 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 40921 event pairs, 416 based on Foata normal form. 829/4920 useless extension candidates. Maximal degree in co-relation 22850. Up to 2618 conditions per place. [2020-10-16 04:56:02,922 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 11 changer transitions 3/73 dead transitions. [2020-10-16 04:56:02,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 675 flow [2020-10-16 04:56:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:56:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:56:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2020-10-16 04:56:02,925 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8324742268041238 [2020-10-16 04:56:02,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2020-10-16 04:56:02,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2020-10-16 04:56:02,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:02,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2020-10-16 04:56:02,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:56:02,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:56:02,929 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:56:02,930 INFO L185 Difference]: Start difference. First operand has 81 places, 68 transitions, 591 flow. Second operand 4 states and 646 transitions. [2020-10-16 04:56:02,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 675 flow [2020-10-16 04:56:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 649 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 04:56:02,968 INFO L241 Difference]: Finished difference. Result has 82 places, 66 transitions, 609 flow [2020-10-16 04:56:02,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=609, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2020-10-16 04:56:02,969 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2020-10-16 04:56:02,969 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 609 flow [2020-10-16 04:56:02,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:56:02,969 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:02,970 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 04:56:02,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:56:02,970 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 771754245, now seen corresponding path program 1 times [2020-10-16 04:56:02,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:02,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808319228] [2020-10-16 04:56:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:03,026 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 04:56:03,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808319228] [2020-10-16 04:56:03,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:03,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:56:03,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091423194] [2020-10-16 04:56:03,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:56:03,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:56:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:56:03,030 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 04:56:03,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 609 flow. Second operand 5 states. [2020-10-16 04:56:03,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:03,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 04:56:03,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:03,456 INFO L129 PetriNetUnfolder]: 1636/3373 cut-off events. [2020-10-16 04:56:03,456 INFO L130 PetriNetUnfolder]: For 20666/26024 co-relation queries the response was YES. [2020-10-16 04:56:03,482 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16940 conditions, 3373 events. 1636/3373 cut-off events. For 20666/26024 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 30001 event pairs, 65 based on Foata normal form. 685/3620 useless extension candidates. Maximal degree in co-relation 16902. Up to 2112 conditions per place. [2020-10-16 04:56:03,495 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 15 changer transitions 1/74 dead transitions. [2020-10-16 04:56:03,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 74 transitions, 721 flow [2020-10-16 04:56:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:56:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:56:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2020-10-16 04:56:03,499 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2020-10-16 04:56:03,500 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2020-10-16 04:56:03,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2020-10-16 04:56:03,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:03,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2020-10-16 04:56:03,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:56:03,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:56:03,505 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:56:03,505 INFO L185 Difference]: Start difference. First operand has 82 places, 66 transitions, 609 flow. Second operand 5 states and 808 transitions. [2020-10-16 04:56:03,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 74 transitions, 721 flow [2020-10-16 04:56:03,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 706 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:03,532 INFO L241 Difference]: Finished difference. Result has 86 places, 69 transitions, 672 flow [2020-10-16 04:56:03,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=672, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2020-10-16 04:56:03,533 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2020-10-16 04:56:03,533 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 672 flow [2020-10-16 04:56:03,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:56:03,533 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:03,534 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:03,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:56:03,534 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1965187475, now seen corresponding path program 1 times [2020-10-16 04:56:03,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:03,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119885085] [2020-10-16 04:56:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:56:03,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119885085] [2020-10-16 04:56:03,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:03,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:56:03,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011861676] [2020-10-16 04:56:03,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:56:03,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:56:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:56:03,586 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 04:56:03,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 672 flow. Second operand 3 states. [2020-10-16 04:56:03,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:03,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 04:56:03,587 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:04,134 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L806-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_13| 0) (= (+ v_~__unbuffered_cnt~0_97 1) v_~__unbuffered_cnt~0_96) (= |v_P3Thread1of1ForFork1_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_13|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset][62], [Black: 127#(<= ~y~0 0), 194#(and (not (= ~a~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 192#(and (= ~a~0 1) (not (= ~__unbuffered_p3_EAX~0 0)) (= ~__unbuffered_cnt~0 0)), Black: 187#(= ~__unbuffered_cnt~0 0), Black: 132#(and (= ~z$w_buff0~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (= ~z$w_buff0~0 ~x~0)), 135#true, Black: 188#(and (= ~a~0 1) (= ~__unbuffered_cnt~0 0)), Black: 189#(not (= ~a~0 0)), 203#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0)), 12#L841true, Black: 138#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 204#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0)), Black: 145#(and (= ~z$w_buff1~0 0) (= ~z~0 1) (= ~z$w_buff1~0 ~z$w_buff0~0) (= ~z$w_buff0_used~0 0)), Black: 148#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (= ~z$w_buff0_used~0 0) (or (= ~z$w_buff1~0 ~z~0) (= ~z~0 1))), 215#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0)), Black: 154#(= ~x~0 0), Black: 216#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0)), 159#(= ~z$r_buff0_thd0~0 0), 95#P3EXITtrue, Black: 160#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), 39#P2EXITtrue, Black: 227#(= ~main$tmp_guard0~0 0), Black: 229#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 233#true, Black: 169#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0)), 174#(= ~y~0 1), 111#P1EXITtrue, 47#P0EXITtrue, P2Thread1of1ForFork0InUse, Black: 241#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), P1Thread1of1ForFork3InUse, Black: 237#(= ~main$tmp_guard0~0 0), P3Thread1of1ForFork1InUse, 247#(= ~x~0 1), Black: 181#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= (* 256 (div ~z$w_buff1_used~0 256)) ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0)), P0Thread1of1ForFork2InUse]) [2020-10-16 04:56:04,134 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2020-10-16 04:56:04,134 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:56:04,134 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:56:04,135 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:56:04,150 INFO L129 PetriNetUnfolder]: 2109/4428 cut-off events. [2020-10-16 04:56:04,151 INFO L130 PetriNetUnfolder]: For 30429/38241 co-relation queries the response was YES. [2020-10-16 04:56:04,180 INFO L80 FinitePrefix]: Finished finitePrefix Result has 23760 conditions, 4428 events. 2109/4428 cut-off events. For 30429/38241 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 41935 event pairs, 259 based on Foata normal form. 293/4109 useless extension candidates. Maximal degree in co-relation 23720. Up to 3134 conditions per place. [2020-10-16 04:56:04,194 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 4 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2020-10-16 04:56:04,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 69 transitions, 686 flow [2020-10-16 04:56:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:56:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:56:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2020-10-16 04:56:04,197 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2020-10-16 04:56:04,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2020-10-16 04:56:04,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2020-10-16 04:56:04,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:04,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2020-10-16 04:56:04,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:56:04,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:56:04,200 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:56:04,201 INFO L185 Difference]: Start difference. First operand has 86 places, 69 transitions, 672 flow. Second operand 3 states and 501 transitions. [2020-10-16 04:56:04,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 69 transitions, 686 flow [2020-10-16 04:56:04,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 69 transitions, 660 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:04,292 INFO L241 Difference]: Finished difference. Result has 87 places, 69 transitions, 657 flow [2020-10-16 04:56:04,292 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2020-10-16 04:56:04,292 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2020-10-16 04:56:04,293 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 657 flow [2020-10-16 04:56:04,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:56:04,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:04,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:04,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:56:04,293 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1506552387, now seen corresponding path program 1 times [2020-10-16 04:56:04,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:04,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014276433] [2020-10-16 04:56:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:04,357 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 04:56:04,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014276433] [2020-10-16 04:56:04,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:04,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:56:04,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425590994] [2020-10-16 04:56:04,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:56:04,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:56:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:56:04,361 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 04:56:04,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 657 flow. Second operand 6 states. [2020-10-16 04:56:04,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:04,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 04:56:04,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:05,045 INFO L129 PetriNetUnfolder]: 1883/3968 cut-off events. [2020-10-16 04:56:05,045 INFO L130 PetriNetUnfolder]: For 27297/41368 co-relation queries the response was YES. [2020-10-16 04:56:05,066 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21466 conditions, 3968 events. 1883/3968 cut-off events. For 27297/41368 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 36967 event pairs, 23 based on Foata normal form. 1002/4377 useless extension candidates. Maximal degree in co-relation 21426. Up to 2843 conditions per place. [2020-10-16 04:56:05,074 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 19 changer transitions 3/77 dead transitions. [2020-10-16 04:56:05,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 77 transitions, 796 flow [2020-10-16 04:56:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:56:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:56:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2020-10-16 04:56:05,078 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2020-10-16 04:56:05,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2020-10-16 04:56:05,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2020-10-16 04:56:05,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:05,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2020-10-16 04:56:05,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:56:05,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:56:05,084 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:56:05,084 INFO L185 Difference]: Start difference. First operand has 87 places, 69 transitions, 657 flow. Second operand 6 states and 970 transitions. [2020-10-16 04:56:05,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 77 transitions, 796 flow [2020-10-16 04:56:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 77 transitions, 783 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 04:56:05,118 INFO L241 Difference]: Finished difference. Result has 92 places, 70 transitions, 711 flow [2020-10-16 04:56:05,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=92, PETRI_TRANSITIONS=70} [2020-10-16 04:56:05,118 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2020-10-16 04:56:05,118 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 70 transitions, 711 flow [2020-10-16 04:56:05,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:56:05,118 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:05,119 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:05,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:56:05,119 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash -81523629, now seen corresponding path program 1 times [2020-10-16 04:56:05,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:05,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270018256] [2020-10-16 04:56:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:56:05,191 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 04:56:05,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270018256] [2020-10-16 04:56:05,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:56:05,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:56:05,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53386263] [2020-10-16 04:56:05,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:56:05,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:56:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:56:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:56:05,194 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 04:56:05,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 70 transitions, 711 flow. Second operand 7 states. [2020-10-16 04:56:05,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:56:05,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 04:56:05,195 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:56:05,724 INFO L129 PetriNetUnfolder]: 1764/3701 cut-off events. [2020-10-16 04:56:05,725 INFO L130 PetriNetUnfolder]: For 37040/52505 co-relation queries the response was YES. [2020-10-16 04:56:05,746 INFO L80 FinitePrefix]: Finished finitePrefix Result has 23921 conditions, 3701 events. 1764/3701 cut-off events. For 37040/52505 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 34426 event pairs, 23 based on Foata normal form. 824/3932 useless extension candidates. Maximal degree in co-relation 23879. Up to 2755 conditions per place. [2020-10-16 04:56:05,750 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 5 selfloop transitions, 18 changer transitions 25/70 dead transitions. [2020-10-16 04:56:05,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 70 transitions, 767 flow [2020-10-16 04:56:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:56:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:56:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2020-10-16 04:56:05,754 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8276877761413843 [2020-10-16 04:56:05,754 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2020-10-16 04:56:05,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2020-10-16 04:56:05,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:56:05,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2020-10-16 04:56:05,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:56:05,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:56:05,760 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:56:05,760 INFO L185 Difference]: Start difference. First operand has 92 places, 70 transitions, 711 flow. Second operand 7 states and 1124 transitions. [2020-10-16 04:56:05,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 70 transitions, 767 flow [2020-10-16 04:56:06,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 70 transitions, 678 flow, removed 19 selfloop flow, removed 6 redundant places. [2020-10-16 04:56:06,026 INFO L241 Difference]: Finished difference. Result has 94 places, 45 transitions, 429 flow [2020-10-16 04:56:06,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=94, PETRI_TRANSITIONS=45} [2020-10-16 04:56:06,027 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2020-10-16 04:56:06,027 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 45 transitions, 429 flow [2020-10-16 04:56:06,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:56:06,027 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:56:06,027 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:56:06,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:56:06,028 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:56:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:56:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -679124931, now seen corresponding path program 1 times [2020-10-16 04:56:06,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:56:06,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062096860] [2020-10-16 04:56:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:56:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:56:06,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:56:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:56:06,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:56:06,128 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:56:06,129 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:56:06,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:56:06,130 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:56:06,145 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In285999619 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In285999619 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In285999619 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In285999619 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse2 (not .cse6)) (.cse3 (not .cse7)) (.cse4 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In285999619 ~z$r_buff1_thd0~0_Out285999619) (or (and (= ~z$w_buff0~0_In285999619 ~z~0_Out285999619) .cse0 .cse1) (and (or (and .cse2 .cse3 (= ~z$w_buff1~0_In285999619 ~z~0_Out285999619)) (and .cse4 (= ~z~0_In285999619 ~z~0_Out285999619))) .cse5)) (or (and .cse0 (= ~z$w_buff0_used~0_Out285999619 0) .cse1) (and (= ~z$w_buff0_used~0_Out285999619 ~z$w_buff0_used~0_In285999619) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In285999619 0)) (= ~z$r_buff0_thd0~0_In285999619 ~z$r_buff0_thd0~0_Out285999619) (or (and (= ~z$w_buff1_used~0_Out285999619 0) .cse2 .cse3) (and .cse4 (= ~z$w_buff1_used~0_Out285999619 ~z$w_buff1_used~0_In285999619)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285999619, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In285999619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In285999619, ~z$w_buff0~0=~z$w_buff0~0_In285999619, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In285999619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In285999619, ~z$w_buff1~0=~z$w_buff1~0_In285999619, ~z~0=~z~0_In285999619} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out285999619, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out285999619|, ~z$w_buff0~0=~z$w_buff0~0_In285999619, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out285999619|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out285999619, ~z$w_buff1~0=~z$w_buff1~0_In285999619, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out285999619|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out285999619|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out285999619|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out285999619|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out285999619, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In285999619, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out285999619, ~z~0=~z~0_Out285999619} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 04:56:06,151 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 04:56:06,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,154 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 04:56:06,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,154 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 04:56:06,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,155 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 04:56:06,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,155 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 04:56:06,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,155 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 04:56:06,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,156 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 04:56:06,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,156 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 04:56:06,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,157 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 04:56:06,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,157 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 04:56:06,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,157 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 04:56:06,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,158 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 04:56:06,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,158 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 04:56:06,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,159 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 04:56:06,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,159 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 04:56:06,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,160 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 04:56:06,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,160 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 04:56:06,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,160 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 04:56:06,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,160 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 04:56:06,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,161 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 04:56:06,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,161 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 04:56:06,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,161 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 04:56:06,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,162 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 04:56:06,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,162 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 04:56:06,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,162 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 04:56:06,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:56:06,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:56:06 BasicIcfg [2020-10-16 04:56:06,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:56:06,254 INFO L168 Benchmark]: Toolchain (without parser) took 24144.67 ms. Allocated memory was 249.6 MB in the beginning and 876.1 MB in the end (delta: 626.5 MB). Free memory was 204.7 MB in the beginning and 215.1 MB in the end (delta: -10.4 MB). Peak memory consumption was 616.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,255 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:56:06,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.93 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 204.7 MB in the beginning and 258.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.56 ms. Allocated memory is still 309.9 MB. Free memory was 255.5 MB in the beginning and 253.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,258 INFO L168 Benchmark]: Boogie Preprocessor took 40.48 ms. Allocated memory is still 309.9 MB. Free memory was 253.0 MB in the beginning and 250.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,262 INFO L168 Benchmark]: RCFGBuilder took 2143.16 ms. Allocated memory was 309.9 MB in the beginning and 355.5 MB in the end (delta: 45.6 MB). Free memory was 250.5 MB in the beginning and 203.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,262 INFO L168 Benchmark]: TraceAbstraction took 21124.18 ms. Allocated memory was 355.5 MB in the beginning and 876.1 MB in the end (delta: 520.6 MB). Free memory was 200.0 MB in the beginning and 215.1 MB in the end (delta: -15.0 MB). Peak memory consumption was 505.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:56:06,273 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.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 757.93 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 204.7 MB in the beginning and 258.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.56 ms. Allocated memory is still 309.9 MB. Free memory was 255.5 MB in the beginning and 253.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.48 ms. Allocated memory is still 309.9 MB. Free memory was 253.0 MB in the beginning and 250.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2143.16 ms. Allocated memory was 309.9 MB in the beginning and 355.5 MB in the end (delta: 45.6 MB). Free memory was 250.5 MB in the beginning and 203.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 21124.18 ms. Allocated memory was 355.5 MB in the beginning and 876.1 MB in the end (delta: 520.6 MB). Free memory was 200.0 MB in the beginning and 215.1 MB in the end (delta: -15.0 MB). Peak memory consumption was 505.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1653 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.3s, 114 PlacesBefore, 40 PlacesAfterwards, 103 TransitionsBefore, 28 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 6523 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1525; [L824] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1526; [L826] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1527; [L828] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1528; [L830] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L768] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 67 SDtfs, 48 SDslu, 33 SDs, 0 SdLazy, 342 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=17, 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, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 20739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...