/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:45:06,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:45:06,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:45:06,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:45:06,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:45:06,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:45:06,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:45:06,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:45:06,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:45:06,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:45:06,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:45:06,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:45:06,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:45:06,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:45:06,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:45:06,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:45:06,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:45:06,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:45:06,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:45:06,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:45:06,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:45:06,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:45:06,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:45:06,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:45:06,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:45:06,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:45:06,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:45:06,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:45:06,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:45:06,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:45:06,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:45:06,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:45:06,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:45:06,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:45:06,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:45:06,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:45:06,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:45:06,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:45:06,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:45:06,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:45:06,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:45:06,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:45:06,952 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:45:06,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:45:06,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:45:06,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:45:06,954 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:45:06,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:45:06,954 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:45:06,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:45:06,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:45:06,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:45:06,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:45:06,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:45:06,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:45:06,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:45:06,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:45:06,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:45:06,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:45:06,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:45:06,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:45:06,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:45:06,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:45:06,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:45:06,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:45:06,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:45:07,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:45:07,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:45:07,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:45:07,306 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:45:07,306 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:45:07,307 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-16 01:45:07,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1296ff93f/cdd6bfb429214daeb3423bec0cc09146/FLAGc9a4ec74e [2020-10-16 01:45:07,965 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:45:07,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-16 01:45:07,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1296ff93f/cdd6bfb429214daeb3423bec0cc09146/FLAGc9a4ec74e [2020-10-16 01:45:08,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1296ff93f/cdd6bfb429214daeb3423bec0cc09146 [2020-10-16 01:45:08,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:45:08,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:45:08,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:45:08,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:45:08,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:45:08,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:08,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5cf630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08, skipping insertion in model container [2020-10-16 01:45:08,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:08,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:45:08,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:45:08,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:45:08,807 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:45:08,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:45:08,970 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:45:08,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08 WrapperNode [2020-10-16 01:45:08,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:45:08,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:45:08,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:45:08,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:45:08,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:45:09,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:45:09,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:45:09,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:45:09,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... [2020-10-16 01:45:09,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:45:09,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:45:09,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:45:09,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:45:09,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:45:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:45:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:45:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:45:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:45:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:45:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:45:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:45:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:45:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:45:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:45:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:45:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:45:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:45:09,217 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:45:11,073 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:45:11,074 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:45:11,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:45:11 BoogieIcfgContainer [2020-10-16 01:45:11,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:45:11,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:45:11,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:45:11,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:45:11,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:45:08" (1/3) ... [2020-10-16 01:45:11,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49afd466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:45:11, skipping insertion in model container [2020-10-16 01:45:11,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:08" (2/3) ... [2020-10-16 01:45:11,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49afd466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:45:11, skipping insertion in model container [2020-10-16 01:45:11,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:45:11" (3/3) ... [2020-10-16 01:45:11,086 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-10-16 01:45:11,098 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:45:11,105 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:45:11,106 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:45:11,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,142 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,156 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,157 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:11,178 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:45:11,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:45:11,200 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:45:11,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:45:11,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:45:11,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:45:11,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:45:11,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:45:11,201 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:45:11,215 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:45:11,259 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:45:11,259 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:11,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:45:11,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:45:11,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-16 01:45:11,274 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:45:11,276 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:45:11,279 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:45:11,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 95 places, 87 transitions, 183 flow [2020-10-16 01:45:11,302 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:45:11,302 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:11,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:45:11,305 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 01:45:11,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:11,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:11,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:11,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:11,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:11,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:11,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:11,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:11,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:11,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:11,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:11,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:11,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:11,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:12,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:12,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:45:12,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:45:12,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:45:12,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:45:12,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:45:12,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:45:12,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:45:12,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:45:12,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:45:12,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:45:12,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:45:12,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:45:12,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:45:12,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:45:12,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:45:12,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:12,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:45:12,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:12,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:12,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:14,237 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-16 01:45:14,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 01:45:14,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:14,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:14,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:15,359 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-16 01:45:15,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:15,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:15,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:15,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:15,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:15,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,272 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:45:16,376 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:45:16,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:16,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:16,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:16,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:16,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:16,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:17,456 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:45:17,561 INFO L132 LiptonReduction]: Checked pairs total: 3955 [2020-10-16 01:45:17,562 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 01:45:17,564 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6292 [2020-10-16 01:45:17,571 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 01:45:17,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:17,572 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:17,573 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:17,573 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash -66047429, now seen corresponding path program 1 times [2020-10-16 01:45:17,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:17,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612506110] [2020-10-16 01:45:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:17,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612506110] [2020-10-16 01:45:17,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:17,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:45:17,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875897726] [2020-10-16 01:45:17,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:45:17,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:45:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:45:17,844 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 165 [2020-10-16 01:45:17,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 01:45:17,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:17,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 165 [2020-10-16 01:45:17,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:17,915 INFO L129 PetriNetUnfolder]: 16/63 cut-off events. [2020-10-16 01:45:17,916 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:17,916 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 63 events. 16/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 216 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 98. Up to 27 conditions per place. [2020-10-16 01:45:17,918 INFO L132 encePairwiseOnDemand]: 161/165 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2020-10-16 01:45:17,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2020-10-16 01:45:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:45:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:45:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2020-10-16 01:45:17,937 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2020-10-16 01:45:17,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2020-10-16 01:45:17,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2020-10-16 01:45:17,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:17,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2020-10-16 01:45:17,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:45:17,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:45:17,956 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:45:17,958 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 429 transitions. [2020-10-16 01:45:17,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2020-10-16 01:45:17,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:17,964 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 01:45:17,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 01:45:17,968 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 01:45:17,968 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 01:45:17,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:45:17,969 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:17,969 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:17,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:45:17,969 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -522474687, now seen corresponding path program 1 times [2020-10-16 01:45:17,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:17,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225381251] [2020-10-16 01:45:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:18,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225381251] [2020-10-16 01:45:18,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:18,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:18,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161291746] [2020-10-16 01:45:18,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:18,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:18,156 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 165 [2020-10-16 01:45:18,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states. [2020-10-16 01:45:18,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:18,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 165 [2020-10-16 01:45:18,157 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:18,329 INFO L129 PetriNetUnfolder]: 175/331 cut-off events. [2020-10-16 01:45:18,329 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2020-10-16 01:45:18,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 331 events. 175/331 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1548 event pairs, 76 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 647. Up to 178 conditions per place. [2020-10-16 01:45:18,333 INFO L132 encePairwiseOnDemand]: 158/165 looper letters, 9 selfloop transitions, 4 changer transitions 12/37 dead transitions. [2020-10-16 01:45:18,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 140 flow [2020-10-16 01:45:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2020-10-16 01:45:18,341 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7478787878787879 [2020-10-16 01:45:18,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2020-10-16 01:45:18,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2020-10-16 01:45:18,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:18,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2020-10-16 01:45:18,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:18,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:18,349 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:18,349 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 617 transitions. [2020-10-16 01:45:18,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 140 flow [2020-10-16 01:45:18,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:18,351 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 84 flow [2020-10-16 01:45:18,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2020-10-16 01:45:18,351 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 01:45:18,352 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 84 flow [2020-10-16 01:45:18,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:18,352 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:18,352 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:18,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:45:18,352 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 982548108, now seen corresponding path program 1 times [2020-10-16 01:45:18,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:18,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668763747] [2020-10-16 01:45:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:18,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668763747] [2020-10-16 01:45:18,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:18,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:18,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598385716] [2020-10-16 01:45:18,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:18,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:18,493 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 165 [2020-10-16 01:45:18,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 84 flow. Second operand 5 states. [2020-10-16 01:45:18,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:18,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 165 [2020-10-16 01:45:18,494 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:18,679 INFO L129 PetriNetUnfolder]: 215/418 cut-off events. [2020-10-16 01:45:18,680 INFO L130 PetriNetUnfolder]: For 266/270 co-relation queries the response was YES. [2020-10-16 01:45:18,682 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 418 events. 215/418 cut-off events. For 266/270 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2138 event pairs, 123 based on Foata normal form. 22/421 useless extension candidates. Maximal degree in co-relation 1013. Up to 265 conditions per place. [2020-10-16 01:45:18,686 INFO L132 encePairwiseOnDemand]: 160/165 looper letters, 11 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2020-10-16 01:45:18,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 177 flow [2020-10-16 01:45:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2020-10-16 01:45:18,690 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7624242424242424 [2020-10-16 01:45:18,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2020-10-16 01:45:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2020-10-16 01:45:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:18,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2020-10-16 01:45:18,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:18,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:18,694 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:18,694 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 84 flow. Second operand 5 states and 629 transitions. [2020-10-16 01:45:18,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 177 flow [2020-10-16 01:45:18,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:18,698 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 118 flow [2020-10-16 01:45:18,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2020-10-16 01:45:18,699 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2020-10-16 01:45:18,699 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 118 flow [2020-10-16 01:45:18,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:18,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:18,699 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:18,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:45:18,700 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 964226643, now seen corresponding path program 1 times [2020-10-16 01:45:18,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:18,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86331034] [2020-10-16 01:45:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:18,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86331034] [2020-10-16 01:45:18,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:18,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:45:18,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960473039] [2020-10-16 01:45:18,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:45:18,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:45:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:45:18,786 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 165 [2020-10-16 01:45:18,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 118 flow. Second operand 4 states. [2020-10-16 01:45:18,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:18,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 165 [2020-10-16 01:45:18,787 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:18,839 INFO L129 PetriNetUnfolder]: 26/109 cut-off events. [2020-10-16 01:45:18,840 INFO L130 PetriNetUnfolder]: For 133/179 co-relation queries the response was YES. [2020-10-16 01:45:18,841 INFO L80 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 109 events. 26/109 cut-off events. For 133/179 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 482 event pairs, 11 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 287. Up to 44 conditions per place. [2020-10-16 01:45:18,842 INFO L132 encePairwiseOnDemand]: 160/165 looper letters, 4 selfloop transitions, 5 changer transitions 5/34 dead transitions. [2020-10-16 01:45:18,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 188 flow [2020-10-16 01:45:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2020-10-16 01:45:18,846 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8412121212121212 [2020-10-16 01:45:18,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2020-10-16 01:45:18,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2020-10-16 01:45:18,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:18,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2020-10-16 01:45:18,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:18,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:18,853 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:18,854 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 118 flow. Second operand 5 states and 694 transitions. [2020-10-16 01:45:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 188 flow [2020-10-16 01:45:18,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 180 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:18,857 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 151 flow [2020-10-16 01:45:18,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2020-10-16 01:45:18,857 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2020-10-16 01:45:18,858 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 151 flow [2020-10-16 01:45:18,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:45:18,858 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:18,858 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:18,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:45:18,859 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1446383947, now seen corresponding path program 1 times [2020-10-16 01:45:18,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:18,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387760008] [2020-10-16 01:45:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:18,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387760008] [2020-10-16 01:45:18,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:18,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:18,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283398174] [2020-10-16 01:45:18,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:18,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:18,977 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 165 [2020-10-16 01:45:18,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 151 flow. Second operand 5 states. [2020-10-16 01:45:18,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:18,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 165 [2020-10-16 01:45:18,978 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:19,209 INFO L129 PetriNetUnfolder]: 157/349 cut-off events. [2020-10-16 01:45:19,209 INFO L130 PetriNetUnfolder]: For 828/842 co-relation queries the response was YES. [2020-10-16 01:45:19,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 349 events. 157/349 cut-off events. For 828/842 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1822 event pairs, 71 based on Foata normal form. 27/367 useless extension candidates. Maximal degree in co-relation 1060. Up to 170 conditions per place. [2020-10-16 01:45:19,214 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 10 selfloop transitions, 8 changer transitions 10/46 dead transitions. [2020-10-16 01:45:19,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 281 flow [2020-10-16 01:45:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2020-10-16 01:45:19,219 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7445887445887446 [2020-10-16 01:45:19,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2020-10-16 01:45:19,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2020-10-16 01:45:19,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:19,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2020-10-16 01:45:19,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:19,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:19,225 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:19,225 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 151 flow. Second operand 7 states and 860 transitions. [2020-10-16 01:45:19,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 281 flow [2020-10-16 01:45:19,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 264 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:19,230 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 206 flow [2020-10-16 01:45:19,230 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2020-10-16 01:45:19,231 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2020-10-16 01:45:19,231 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 206 flow [2020-10-16 01:45:19,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:19,231 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:19,231 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:19,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:45:19,231 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 717713902, now seen corresponding path program 1 times [2020-10-16 01:45:19,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:19,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278139001] [2020-10-16 01:45:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:19,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278139001] [2020-10-16 01:45:19,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:19,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:19,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555448385] [2020-10-16 01:45:19,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:19,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:19,395 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 165 [2020-10-16 01:45:19,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 206 flow. Second operand 6 states. [2020-10-16 01:45:19,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:19,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 165 [2020-10-16 01:45:19,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:19,586 INFO L129 PetriNetUnfolder]: 135/302 cut-off events. [2020-10-16 01:45:19,586 INFO L130 PetriNetUnfolder]: For 920/928 co-relation queries the response was YES. [2020-10-16 01:45:19,589 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 302 events. 135/302 cut-off events. For 920/928 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1509 event pairs, 16 based on Foata normal form. 12/309 useless extension candidates. Maximal degree in co-relation 1052. Up to 155 conditions per place. [2020-10-16 01:45:19,591 INFO L132 encePairwiseOnDemand]: 160/165 looper letters, 11 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2020-10-16 01:45:19,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 296 flow [2020-10-16 01:45:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:45:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:45:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2020-10-16 01:45:19,595 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7595959595959596 [2020-10-16 01:45:19,595 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2020-10-16 01:45:19,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2020-10-16 01:45:19,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:19,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2020-10-16 01:45:19,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:45:19,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:45:19,599 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:45:19,599 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 206 flow. Second operand 6 states and 752 transitions. [2020-10-16 01:45:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 296 flow [2020-10-16 01:45:19,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 282 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:19,607 INFO L241 Difference]: Finished difference. Result has 50 places, 34 transitions, 221 flow [2020-10-16 01:45:19,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2020-10-16 01:45:19,608 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2020-10-16 01:45:19,608 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 221 flow [2020-10-16 01:45:19,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:19,608 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:19,608 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:19,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:45:19,608 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -665023610, now seen corresponding path program 1 times [2020-10-16 01:45:19,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:19,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625052670] [2020-10-16 01:45:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:19,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625052670] [2020-10-16 01:45:19,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:19,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:19,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774810218] [2020-10-16 01:45:19,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:19,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:19,695 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 165 [2020-10-16 01:45:19,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 221 flow. Second operand 5 states. [2020-10-16 01:45:19,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:19,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 165 [2020-10-16 01:45:19,696 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:19,816 INFO L129 PetriNetUnfolder]: 181/362 cut-off events. [2020-10-16 01:45:19,816 INFO L130 PetriNetUnfolder]: For 1276/1302 co-relation queries the response was YES. [2020-10-16 01:45:19,819 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 362 events. 181/362 cut-off events. For 1276/1302 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 89 based on Foata normal form. 21/377 useless extension candidates. Maximal degree in co-relation 1281. Up to 227 conditions per place. [2020-10-16 01:45:19,822 INFO L132 encePairwiseOnDemand]: 160/165 looper letters, 16 selfloop transitions, 4 changer transitions 8/46 dead transitions. [2020-10-16 01:45:19,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 329 flow [2020-10-16 01:45:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2020-10-16 01:45:19,825 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7684848484848484 [2020-10-16 01:45:19,825 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2020-10-16 01:45:19,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2020-10-16 01:45:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:19,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2020-10-16 01:45:19,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:19,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:19,831 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:19,831 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 221 flow. Second operand 5 states and 634 transitions. [2020-10-16 01:45:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 329 flow [2020-10-16 01:45:19,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-16 01:45:19,839 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 234 flow [2020-10-16 01:45:19,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2020-10-16 01:45:19,840 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2020-10-16 01:45:19,840 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 234 flow [2020-10-16 01:45:19,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:19,841 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:19,841 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:19,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:45:19,841 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:19,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1587607056, now seen corresponding path program 1 times [2020-10-16 01:45:19,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:19,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797401791] [2020-10-16 01:45:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:20,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797401791] [2020-10-16 01:45:20,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:20,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:20,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504830211] [2020-10-16 01:45:20,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:45:20,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:45:20,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:45:20,012 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 165 [2020-10-16 01:45:20,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 234 flow. Second operand 7 states. [2020-10-16 01:45:20,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:20,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 165 [2020-10-16 01:45:20,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:20,227 INFO L129 PetriNetUnfolder]: 161/357 cut-off events. [2020-10-16 01:45:20,227 INFO L130 PetriNetUnfolder]: For 1560/1573 co-relation queries the response was YES. [2020-10-16 01:45:20,230 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 357 events. 161/357 cut-off events. For 1560/1573 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1819 event pairs, 22 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 1361. Up to 175 conditions per place. [2020-10-16 01:45:20,233 INFO L132 encePairwiseOnDemand]: 158/165 looper letters, 11 selfloop transitions, 13 changer transitions 5/49 dead transitions. [2020-10-16 01:45:20,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 358 flow [2020-10-16 01:45:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2020-10-16 01:45:20,237 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7471861471861472 [2020-10-16 01:45:20,237 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2020-10-16 01:45:20,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2020-10-16 01:45:20,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:20,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2020-10-16 01:45:20,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:20,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:20,242 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:20,242 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 234 flow. Second operand 7 states and 863 transitions. [2020-10-16 01:45:20,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 358 flow [2020-10-16 01:45:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 350 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:20,247 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 296 flow [2020-10-16 01:45:20,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2020-10-16 01:45:20,248 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2020-10-16 01:45:20,248 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 296 flow [2020-10-16 01:45:20,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:45:20,249 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:20,249 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:20,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:45:20,249 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1741446138, now seen corresponding path program 2 times [2020-10-16 01:45:20,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:20,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885887028] [2020-10-16 01:45:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:20,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885887028] [2020-10-16 01:45:20,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:20,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:20,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136699359] [2020-10-16 01:45:20,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:20,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:20,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:20,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:20,339 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 165 [2020-10-16 01:45:20,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 296 flow. Second operand 6 states. [2020-10-16 01:45:20,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:20,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 165 [2020-10-16 01:45:20,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:20,521 INFO L129 PetriNetUnfolder]: 142/333 cut-off events. [2020-10-16 01:45:20,521 INFO L130 PetriNetUnfolder]: For 1936/1945 co-relation queries the response was YES. [2020-10-16 01:45:20,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 333 events. 142/333 cut-off events. For 1936/1945 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1744 event pairs, 29 based on Foata normal form. 18/342 useless extension candidates. Maximal degree in co-relation 1385. Up to 145 conditions per place. [2020-10-16 01:45:20,527 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 16 selfloop transitions, 9 changer transitions 5/50 dead transitions. [2020-10-16 01:45:20,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 432 flow [2020-10-16 01:45:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:45:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:45:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2020-10-16 01:45:20,530 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2020-10-16 01:45:20,530 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2020-10-16 01:45:20,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2020-10-16 01:45:20,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:20,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2020-10-16 01:45:20,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:45:20,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:45:20,535 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:45:20,535 INFO L185 Difference]: Start difference. First operand has 56 places, 41 transitions, 296 flow. Second operand 6 states and 740 transitions. [2020-10-16 01:45:20,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 432 flow [2020-10-16 01:45:20,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 406 flow, removed 13 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:20,542 INFO L241 Difference]: Finished difference. Result has 59 places, 43 transitions, 334 flow [2020-10-16 01:45:20,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2020-10-16 01:45:20,542 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2020-10-16 01:45:20,543 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 334 flow [2020-10-16 01:45:20,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:20,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:20,543 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:20,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:45:20,543 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1729538387, now seen corresponding path program 1 times [2020-10-16 01:45:20,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:20,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562779662] [2020-10-16 01:45:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:20,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562779662] [2020-10-16 01:45:20,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:20,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:20,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552902862] [2020-10-16 01:45:20,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:20,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:20,708 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 165 [2020-10-16 01:45:20,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 334 flow. Second operand 6 states. [2020-10-16 01:45:20,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:20,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 165 [2020-10-16 01:45:20,710 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:20,957 INFO L129 PetriNetUnfolder]: 236/538 cut-off events. [2020-10-16 01:45:20,957 INFO L130 PetriNetUnfolder]: For 2686/2731 co-relation queries the response was YES. [2020-10-16 01:45:20,961 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 538 events. 236/538 cut-off events. For 2686/2731 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3252 event pairs, 26 based on Foata normal form. 54/588 useless extension candidates. Maximal degree in co-relation 2400. Up to 238 conditions per place. [2020-10-16 01:45:20,966 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 21 selfloop transitions, 27 changer transitions 9/75 dead transitions. [2020-10-16 01:45:20,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 721 flow [2020-10-16 01:45:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2020-10-16 01:45:20,970 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7541125541125541 [2020-10-16 01:45:20,970 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2020-10-16 01:45:20,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2020-10-16 01:45:20,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:20,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2020-10-16 01:45:20,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:20,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:20,976 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:20,976 INFO L185 Difference]: Start difference. First operand has 59 places, 43 transitions, 334 flow. Second operand 7 states and 871 transitions. [2020-10-16 01:45:20,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 721 flow [2020-10-16 01:45:20,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 676 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:20,985 INFO L241 Difference]: Finished difference. Result has 65 places, 62 transitions, 572 flow [2020-10-16 01:45:20,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2020-10-16 01:45:20,986 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2020-10-16 01:45:20,986 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 572 flow [2020-10-16 01:45:20,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:20,987 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:20,987 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:20,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:45:20,988 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash -103547629, now seen corresponding path program 2 times [2020-10-16 01:45:20,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:20,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007431249] [2020-10-16 01:45:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:21,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 01:45:21,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007431249] [2020-10-16 01:45:21,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:21,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:21,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557886611] [2020-10-16 01:45:21,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:21,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:21,102 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 165 [2020-10-16 01:45:21,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 572 flow. Second operand 6 states. [2020-10-16 01:45:21,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:21,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 165 [2020-10-16 01:45:21,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:21,378 INFO L129 PetriNetUnfolder]: 232/566 cut-off events. [2020-10-16 01:45:21,378 INFO L130 PetriNetUnfolder]: For 4098/4191 co-relation queries the response was YES. [2020-10-16 01:45:21,385 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 566 events. 232/566 cut-off events. For 4098/4191 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3656 event pairs, 15 based on Foata normal form. 93/652 useless extension candidates. Maximal degree in co-relation 2904. Up to 186 conditions per place. [2020-10-16 01:45:21,391 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 38 selfloop transitions, 16 changer transitions 8/80 dead transitions. [2020-10-16 01:45:21,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 881 flow [2020-10-16 01:45:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2020-10-16 01:45:21,396 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7489177489177489 [2020-10-16 01:45:21,396 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2020-10-16 01:45:21,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2020-10-16 01:45:21,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:21,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2020-10-16 01:45:21,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:21,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:21,401 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:21,402 INFO L185 Difference]: Start difference. First operand has 65 places, 62 transitions, 572 flow. Second operand 7 states and 865 transitions. [2020-10-16 01:45:21,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 881 flow [2020-10-16 01:45:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 839 flow, removed 21 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:21,420 INFO L241 Difference]: Finished difference. Result has 70 places, 62 transitions, 581 flow [2020-10-16 01:45:21,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=581, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2020-10-16 01:45:21,421 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2020-10-16 01:45:21,421 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 581 flow [2020-10-16 01:45:21,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:21,422 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:21,422 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:21,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:45:21,422 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash -163623543, now seen corresponding path program 1 times [2020-10-16 01:45:21,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:21,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144624976] [2020-10-16 01:45:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:21,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144624976] [2020-10-16 01:45:21,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:21,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:21,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280029527] [2020-10-16 01:45:21,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:45:21,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:45:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:45:21,611 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 165 [2020-10-16 01:45:21,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 581 flow. Second operand 7 states. [2020-10-16 01:45:21,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:21,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 165 [2020-10-16 01:45:21,613 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:21,870 INFO L129 PetriNetUnfolder]: 247/597 cut-off events. [2020-10-16 01:45:21,871 INFO L130 PetriNetUnfolder]: For 3885/3945 co-relation queries the response was YES. [2020-10-16 01:45:21,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 597 events. 247/597 cut-off events. For 3885/3945 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3929 event pairs, 20 based on Foata normal form. 31/619 useless extension candidates. Maximal degree in co-relation 2997. Up to 302 conditions per place. [2020-10-16 01:45:21,881 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 33 selfloop transitions, 18 changer transitions 2/77 dead transitions. [2020-10-16 01:45:21,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 846 flow [2020-10-16 01:45:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2020-10-16 01:45:21,885 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2020-10-16 01:45:21,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2020-10-16 01:45:21,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2020-10-16 01:45:21,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:21,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2020-10-16 01:45:21,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:21,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:21,890 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:21,891 INFO L185 Difference]: Start difference. First operand has 70 places, 62 transitions, 581 flow. Second operand 7 states and 819 transitions. [2020-10-16 01:45:21,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 846 flow [2020-10-16 01:45:21,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 799 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 01:45:21,908 INFO L241 Difference]: Finished difference. Result has 72 places, 69 transitions, 680 flow [2020-10-16 01:45:21,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=680, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2020-10-16 01:45:21,909 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2020-10-16 01:45:21,909 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 680 flow [2020-10-16 01:45:21,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:45:21,909 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:21,910 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:21,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:45:21,910 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1622645739, now seen corresponding path program 2 times [2020-10-16 01:45:21,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:21,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025756594] [2020-10-16 01:45:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:22,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025756594] [2020-10-16 01:45:22,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:22,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:22,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880269644] [2020-10-16 01:45:22,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:45:22,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:22,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:45:22,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:45:22,066 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 165 [2020-10-16 01:45:22,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 680 flow. Second operand 7 states. [2020-10-16 01:45:22,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:22,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 165 [2020-10-16 01:45:22,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:22,391 INFO L129 PetriNetUnfolder]: 243/608 cut-off events. [2020-10-16 01:45:22,392 INFO L130 PetriNetUnfolder]: For 3930/3979 co-relation queries the response was YES. [2020-10-16 01:45:22,397 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 608 events. 243/608 cut-off events. For 3930/3979 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 21 based on Foata normal form. 32/631 useless extension candidates. Maximal degree in co-relation 3128. Up to 258 conditions per place. [2020-10-16 01:45:22,401 INFO L132 encePairwiseOnDemand]: 158/165 looper letters, 13 selfloop transitions, 32 changer transitions 5/74 dead transitions. [2020-10-16 01:45:22,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 856 flow [2020-10-16 01:45:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2020-10-16 01:45:22,405 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2020-10-16 01:45:22,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2020-10-16 01:45:22,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2020-10-16 01:45:22,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:22,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2020-10-16 01:45:22,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:22,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:22,411 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:22,411 INFO L185 Difference]: Start difference. First operand has 72 places, 69 transitions, 680 flow. Second operand 7 states and 840 transitions. [2020-10-16 01:45:22,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 856 flow [2020-10-16 01:45:22,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 823 flow, removed 10 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:22,424 INFO L241 Difference]: Finished difference. Result has 76 places, 68 transitions, 726 flow [2020-10-16 01:45:22,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=726, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2020-10-16 01:45:22,425 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2020-10-16 01:45:22,425 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 726 flow [2020-10-16 01:45:22,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:45:22,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:22,425 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:22,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:45:22,425 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -458821427, now seen corresponding path program 3 times [2020-10-16 01:45:22,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:22,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348732919] [2020-10-16 01:45:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:22,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348732919] [2020-10-16 01:45:22,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:22,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:45:22,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595266456] [2020-10-16 01:45:22,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:45:22,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:45:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:45:22,684 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 165 [2020-10-16 01:45:22,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 726 flow. Second operand 8 states. [2020-10-16 01:45:22,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:22,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 165 [2020-10-16 01:45:22,685 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:22,978 INFO L129 PetriNetUnfolder]: 203/532 cut-off events. [2020-10-16 01:45:22,978 INFO L130 PetriNetUnfolder]: For 3772/3823 co-relation queries the response was YES. [2020-10-16 01:45:22,983 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 532 events. 203/532 cut-off events. For 3772/3823 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3607 event pairs, 12 based on Foata normal form. 36/560 useless extension candidates. Maximal degree in co-relation 2810. Up to 171 conditions per place. [2020-10-16 01:45:22,987 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 21 selfloop transitions, 23 changer transitions 6/73 dead transitions. [2020-10-16 01:45:22,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 894 flow [2020-10-16 01:45:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2020-10-16 01:45:22,991 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6961038961038961 [2020-10-16 01:45:22,991 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2020-10-16 01:45:22,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2020-10-16 01:45:22,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:22,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2020-10-16 01:45:22,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:22,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:22,996 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:22,996 INFO L185 Difference]: Start difference. First operand has 76 places, 68 transitions, 726 flow. Second operand 7 states and 804 transitions. [2020-10-16 01:45:22,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 894 flow [2020-10-16 01:45:23,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 826 flow, removed 16 selfloop flow, removed 5 redundant places. [2020-10-16 01:45:23,011 INFO L241 Difference]: Finished difference. Result has 78 places, 64 transitions, 678 flow [2020-10-16 01:45:23,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=678, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2020-10-16 01:45:23,011 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2020-10-16 01:45:23,011 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 678 flow [2020-10-16 01:45:23,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:45:23,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:23,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:23,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:45:23,012 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2077203583, now seen corresponding path program 1 times [2020-10-16 01:45:23,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:23,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412137852] [2020-10-16 01:45:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:23,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412137852] [2020-10-16 01:45:23,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:23,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:23,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535949569] [2020-10-16 01:45:23,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:45:23,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:45:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:45:23,066 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 165 [2020-10-16 01:45:23,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 678 flow. Second operand 4 states. [2020-10-16 01:45:23,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:23,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 165 [2020-10-16 01:45:23,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:23,241 INFO L129 PetriNetUnfolder]: 282/676 cut-off events. [2020-10-16 01:45:23,241 INFO L130 PetriNetUnfolder]: For 3504/3609 co-relation queries the response was YES. [2020-10-16 01:45:23,247 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 676 events. 282/676 cut-off events. For 3504/3609 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4643 event pairs, 76 based on Foata normal form. 166/817 useless extension candidates. Maximal degree in co-relation 2554. Up to 362 conditions per place. [2020-10-16 01:45:23,252 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 10 selfloop transitions, 8 changer transitions 4/71 dead transitions. [2020-10-16 01:45:23,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 682 flow [2020-10-16 01:45:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2020-10-16 01:45:23,258 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8278787878787879 [2020-10-16 01:45:23,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2020-10-16 01:45:23,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2020-10-16 01:45:23,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:23,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2020-10-16 01:45:23,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:23,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:23,264 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:23,265 INFO L185 Difference]: Start difference. First operand has 78 places, 64 transitions, 678 flow. Second operand 5 states and 683 transitions. [2020-10-16 01:45:23,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 682 flow [2020-10-16 01:45:23,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 623 flow, removed 6 selfloop flow, removed 9 redundant places. [2020-10-16 01:45:23,283 INFO L241 Difference]: Finished difference. Result has 74 places, 64 transitions, 607 flow [2020-10-16 01:45:23,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2020-10-16 01:45:23,284 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 41 predicate places. [2020-10-16 01:45:23,284 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 607 flow [2020-10-16 01:45:23,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:45:23,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:23,284 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:23,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:45:23,285 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1732570277, now seen corresponding path program 1 times [2020-10-16 01:45:23,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:23,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865012302] [2020-10-16 01:45:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:23,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865012302] [2020-10-16 01:45:23,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:23,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:23,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142711225] [2020-10-16 01:45:23,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:23,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:23,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:23,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:23,386 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 165 [2020-10-16 01:45:23,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 607 flow. Second operand 5 states. [2020-10-16 01:45:23,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:23,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 165 [2020-10-16 01:45:23,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:23,524 INFO L129 PetriNetUnfolder]: 138/440 cut-off events. [2020-10-16 01:45:23,524 INFO L130 PetriNetUnfolder]: For 2096/2435 co-relation queries the response was YES. [2020-10-16 01:45:23,528 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 440 events. 138/440 cut-off events. For 2096/2435 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3171 event pairs, 8 based on Foata normal form. 304/730 useless extension candidates. Maximal degree in co-relation 1927. Up to 270 conditions per place. [2020-10-16 01:45:23,530 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 6 selfloop transitions, 15 changer transitions 4/69 dead transitions. [2020-10-16 01:45:23,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 69 transitions, 657 flow [2020-10-16 01:45:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2020-10-16 01:45:23,534 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8277056277056277 [2020-10-16 01:45:23,534 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2020-10-16 01:45:23,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2020-10-16 01:45:23,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:23,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2020-10-16 01:45:23,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:23,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:23,542 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:23,542 INFO L185 Difference]: Start difference. First operand has 74 places, 64 transitions, 607 flow. Second operand 7 states and 956 transitions. [2020-10-16 01:45:23,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 69 transitions, 657 flow [2020-10-16 01:45:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 626 flow, removed 6 selfloop flow, removed 5 redundant places. [2020-10-16 01:45:23,550 INFO L241 Difference]: Finished difference. Result has 78 places, 65 transitions, 612 flow [2020-10-16 01:45:23,550 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2020-10-16 01:45:23,550 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2020-10-16 01:45:23,551 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 612 flow [2020-10-16 01:45:23,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:23,551 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:23,551 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:23,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:45:23,551 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash -683186465, now seen corresponding path program 1 times [2020-10-16 01:45:23,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:23,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911096634] [2020-10-16 01:45:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:23,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911096634] [2020-10-16 01:45:23,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:23,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:23,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716832516] [2020-10-16 01:45:23,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:23,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:23,640 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 165 [2020-10-16 01:45:23,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 612 flow. Second operand 6 states. [2020-10-16 01:45:23,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:23,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 165 [2020-10-16 01:45:23,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:23,878 INFO L129 PetriNetUnfolder]: 241/741 cut-off events. [2020-10-16 01:45:23,878 INFO L130 PetriNetUnfolder]: For 5057/5392 co-relation queries the response was YES. [2020-10-16 01:45:23,884 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 741 events. 241/741 cut-off events. For 5057/5392 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 5927 event pairs, 17 based on Foata normal form. 96/814 useless extension candidates. Maximal degree in co-relation 3719. Up to 434 conditions per place. [2020-10-16 01:45:23,889 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 34 selfloop transitions, 8 changer transitions 13/88 dead transitions. [2020-10-16 01:45:23,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 988 flow [2020-10-16 01:45:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2020-10-16 01:45:23,893 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7281385281385281 [2020-10-16 01:45:23,893 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2020-10-16 01:45:23,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2020-10-16 01:45:23,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:23,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2020-10-16 01:45:23,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:23,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:23,900 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:23,900 INFO L185 Difference]: Start difference. First operand has 78 places, 65 transitions, 612 flow. Second operand 7 states and 841 transitions. [2020-10-16 01:45:23,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 88 transitions, 988 flow [2020-10-16 01:45:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 88 transitions, 949 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:23,963 INFO L241 Difference]: Finished difference. Result has 85 places, 63 transitions, 576 flow [2020-10-16 01:45:23,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=85, PETRI_TRANSITIONS=63} [2020-10-16 01:45:23,964 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2020-10-16 01:45:23,964 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 63 transitions, 576 flow [2020-10-16 01:45:23,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:23,964 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:23,965 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:23,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:45:23,965 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash -282740548, now seen corresponding path program 1 times [2020-10-16 01:45:23,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:23,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79773744] [2020-10-16 01:45:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:45:24,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79773744] [2020-10-16 01:45:24,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:24,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:24,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027393831] [2020-10-16 01:45:24,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:24,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:24,031 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 165 [2020-10-16 01:45:24,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 63 transitions, 576 flow. Second operand 6 states. [2020-10-16 01:45:24,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:24,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 165 [2020-10-16 01:45:24,032 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:24,202 INFO L129 PetriNetUnfolder]: 148/501 cut-off events. [2020-10-16 01:45:24,202 INFO L130 PetriNetUnfolder]: For 2706/3194 co-relation queries the response was YES. [2020-10-16 01:45:24,207 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 501 events. 148/501 cut-off events. For 2706/3194 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4012 event pairs, 0 based on Foata normal form. 320/797 useless extension candidates. Maximal degree in co-relation 2227. Up to 165 conditions per place. [2020-10-16 01:45:24,209 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 2 selfloop transitions, 17 changer transitions 25/67 dead transitions. [2020-10-16 01:45:24,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 67 transitions, 654 flow [2020-10-16 01:45:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:45:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:45:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1223 transitions. [2020-10-16 01:45:24,215 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8235690235690236 [2020-10-16 01:45:24,215 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1223 transitions. [2020-10-16 01:45:24,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1223 transitions. [2020-10-16 01:45:24,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:24,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1223 transitions. [2020-10-16 01:45:24,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:45:24,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:45:24,222 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:45:24,222 INFO L185 Difference]: Start difference. First operand has 85 places, 63 transitions, 576 flow. Second operand 9 states and 1223 transitions. [2020-10-16 01:45:24,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 67 transitions, 654 flow [2020-10-16 01:45:24,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 67 transitions, 581 flow, removed 15 selfloop flow, removed 9 redundant places. [2020-10-16 01:45:24,234 INFO L241 Difference]: Finished difference. Result has 85 places, 42 transitions, 350 flow [2020-10-16 01:45:24,234 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=350, PETRI_PLACES=85, PETRI_TRANSITIONS=42} [2020-10-16 01:45:24,234 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2020-10-16 01:45:24,234 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 42 transitions, 350 flow [2020-10-16 01:45:24,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:24,234 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:24,235 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] [2020-10-16 01:45:24,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:45:24,235 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:45:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash -255536752, now seen corresponding path program 1 times [2020-10-16 01:45:24,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:24,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559619494] [2020-10-16 01:45:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:24,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:24,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:24,342 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:45:24,343 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:45:24,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:45:24,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:45:24,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:24,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:45:24 BasicIcfg [2020-10-16 01:45:24,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:45:24,462 INFO L168 Benchmark]: Toolchain (without parser) took 16221.00 ms. Allocated memory was 250.1 MB in the beginning and 651.7 MB in the end (delta: 401.6 MB). Free memory was 205.1 MB in the beginning and 501.8 MB in the end (delta: -296.7 MB). Peak memory consumption was 104.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:24,463 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:45:24,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.85 ms. Allocated memory was 250.1 MB in the beginning and 309.3 MB in the end (delta: 59.2 MB). Free memory was 205.1 MB in the beginning and 260.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:24,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.37 ms. Allocated memory is still 309.3 MB. Free memory was 260.0 MB in the beginning and 257.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 01:45:24,465 INFO L168 Benchmark]: Boogie Preprocessor took 43.71 ms. Allocated memory is still 309.3 MB. Free memory was 257.5 MB in the beginning and 255.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:24,470 INFO L168 Benchmark]: RCFGBuilder took 1941.60 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 255.0 MB in the beginning and 208.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:24,470 INFO L168 Benchmark]: TraceAbstraction took 13382.65 ms. Allocated memory was 356.5 MB in the beginning and 651.7 MB in the end (delta: 295.2 MB). Free memory was 208.1 MB in the beginning and 501.8 MB in the end (delta: -293.8 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:24,481 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.27 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 727.85 ms. Allocated memory was 250.1 MB in the beginning and 309.3 MB in the end (delta: 59.2 MB). Free memory was 205.1 MB in the beginning and 260.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 116.37 ms. Allocated memory is still 309.3 MB. Free memory was 260.0 MB in the beginning and 257.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.71 ms. Allocated memory is still 309.3 MB. Free memory was 257.5 MB in the beginning and 255.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1941.60 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 255.0 MB in the beginning and 208.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13382.65 ms. Allocated memory was 356.5 MB in the beginning and 651.7 MB in the end (delta: 295.2 MB). Free memory was 208.1 MB in the beginning and 501.8 MB in the end (delta: -293.8 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 997 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 95 PlacesBefore, 33 PlacesAfterwards, 87 TransitionsBefore, 24 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 3955 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2504; [L801] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2505; [L803] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2506; [L805] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 13.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 108 SDtfs, 95 SDslu, 122 SDs, 0 SdLazy, 574 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 27141 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...