/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/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 23:58:49,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 23:58:49,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 23:58:49,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 23:58:49,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 23:58:49,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 23:58:49,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 23:58:50,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 23:58:50,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 23:58:50,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 23:58:50,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 23:58:50,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 23:58:50,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 23:58:50,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 23:58:50,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 23:58:50,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 23:58:50,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 23:58:50,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 23:58:50,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 23:58:50,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 23:58:50,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 23:58:50,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 23:58:50,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 23:58:50,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 23:58:50,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 23:58:50,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 23:58:50,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 23:58:50,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 23:58:50,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 23:58:50,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 23:58:50,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 23:58:50,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 23:58:50,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 23:58:50,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 23:58:50,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 23:58:50,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 23:58:50,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 23:58:50,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 23:58:50,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 23:58:50,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 23:58:50,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 23:58:50,062 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-15 23:58:50,102 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 23:58:50,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 23:58:50,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 23:58:50,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 23:58:50,104 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 23:58:50,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 23:58:50,104 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 23:58:50,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 23:58:50,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 23:58:50,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 23:58:50,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 23:58:50,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 23:58:50,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 23:58:50,105 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 23:58:50,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 23:58:50,106 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 23:58:50,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 23:58:50,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 23:58:50,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 23:58:50,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 23:58:50,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 23:58:50,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 23:58:50,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 23:58:50,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 23:58:50,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 23:58:50,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 23:58:50,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 23:58:50,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-15 23:58:50,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 23:58:50,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 23:58:50,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 23:58:50,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 23:58:50,446 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 23:58:50,447 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 23:58:50,447 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-15 23:58:50,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf93db70/da7c0a481b77452183c2664c66c19f00/FLAGdd0b2e7a2 [2020-10-15 23:58:51,029 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 23:58:51,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-15 23:58:51,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf93db70/da7c0a481b77452183c2664c66c19f00/FLAGdd0b2e7a2 [2020-10-15 23:58:51,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf93db70/da7c0a481b77452183c2664c66c19f00 [2020-10-15 23:58:51,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 23:58:51,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 23:58:51,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 23:58:51,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 23:58:51,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 23:58:51,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 11:58:51" (1/1) ... [2020-10-15 23:58:51,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4373986f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:51, skipping insertion in model container [2020-10-15 23:58:51,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 11:58:51" (1/1) ... [2020-10-15 23:58:51,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 23:58:51,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 23:58:51,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 23:58:51,945 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 23:58:51,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 23:58:52,176 INFO L208 MainTranslator]: Completed translation [2020-10-15 23:58:52,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52 WrapperNode [2020-10-15 23:58:52,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 23:58:52,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 23:58:52,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 23:58:52,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 23:58:52,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 23:58:52,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 23:58:52,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 23:58:52,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 23:58:52,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (1/1) ... [2020-10-15 23:58:52,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 23:58:52,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 23:58:52,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 23:58:52,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 23:58:52,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (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-15 23:58:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 23:58:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 23:58:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 23:58:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-15 23:58:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-15 23:58:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-15 23:58:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-15 23:58:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-15 23:58:52,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-15 23:58:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-15 23:58:52,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-15 23:58:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 23:58:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-15 23:58:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 23:58:52,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 23:58:52,336 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 23:58:52,700 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 23:58:52,701 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-15 23:58:52,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 11:58:52 BoogieIcfgContainer [2020-10-15 23:58:52,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 23:58:52,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 23:58:52,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 23:58:52,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 23:58:52,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 11:58:51" (1/3) ... [2020-10-15 23:58:52,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db0ad0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 11:58:52, skipping insertion in model container [2020-10-15 23:58:52,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 11:58:52" (2/3) ... [2020-10-15 23:58:52,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db0ad0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 11:58:52, skipping insertion in model container [2020-10-15 23:58:52,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 11:58:52" (3/3) ... [2020-10-15 23:58:52,714 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-15 23:58:52,726 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 23:58:52,733 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-15 23:58:52,734 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 23:58:52,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,780 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,780 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,784 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,784 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,786 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,786 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,789 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,789 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,794 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,794 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,797 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,809 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,810 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,810 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,810 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,810 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,811 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,811 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,813 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,813 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,814 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,814 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,814 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,815 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,815 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,815 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,815 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,816 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,816 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,816 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,817 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,817 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,817 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,817 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,818 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,818 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,818 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,818 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,819 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,819 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,819 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,819 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,820 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,820 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,824 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,824 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,824 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,825 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,834 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,834 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,835 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,835 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,837 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,837 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,838 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,838 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,842 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,842 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,842 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,842 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,843 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,843 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,843 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,843 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,843 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,844 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,844 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,844 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,844 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,845 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,845 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,845 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,847 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,848 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,848 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,849 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,851 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,851 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,851 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,851 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,854 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,854 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,854 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,855 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,855 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,857 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,857 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,859 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,860 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,860 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,860 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,862 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,862 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,863 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,863 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,865 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,865 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,865 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:52,866 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 23:58:53,008 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-15 23:58:53,029 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 23:58:53,029 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-15 23:58:53,030 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 23:58:53,030 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 23:58:53,030 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 23:58:53,030 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 23:58:53,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 23:58:53,030 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 23:58:53,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-15 23:58:53,184 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-15 23:58:53,185 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-15 23:58:53,198 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-10-15 23:58:53,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 243 transitions, 866 flow [2020-10-15 23:58:53,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 135 transitions, 423 flow [2020-10-15 23:58:53,219 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 23:58:53,222 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 135 transitions, 423 flow [2020-10-15 23:58:53,225 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 135 transitions, 423 flow [2020-10-15 23:58:53,225 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 135 transitions, 423 flow [2020-10-15 23:58:53,291 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-15 23:58:53,291 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-15 23:58:53,294 INFO L80 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 745 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 325. Up to 24 conditions per place. [2020-10-15 23:58:53,305 INFO L117 LiptonReduction]: Number of co-enabled transitions 4038 [2020-10-15 23:58:54,738 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-15 23:58:55,167 INFO L132 LiptonReduction]: Checked pairs total: 32154 [2020-10-15 23:58:55,167 INFO L134 LiptonReduction]: Total number of compositions: 64 [2020-10-15 23:58:55,171 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1954 [2020-10-15 23:58:55,180 INFO L129 PetriNetUnfolder]: 2/14 cut-off events. [2020-10-15 23:58:55,180 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-15 23:58:55,181 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:58:55,182 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:58:55,182 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:58:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:58:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash -18467469, now seen corresponding path program 1 times [2020-10-15 23:58:55,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:58:55,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904402837] [2020-10-15 23:58:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:58:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:58:55,476 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-15 23:58:55,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904402837] [2020-10-15 23:58:55,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:58:55,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:58:55,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149582321] [2020-10-15 23:58:55,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:58:55,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:58:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:58:55,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:58:55,531 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 318 [2020-10-15 23:58:55,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 77 transitions, 307 flow. Second operand 6 states. [2020-10-15 23:58:55,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:58:55,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 318 [2020-10-15 23:58:55,538 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:58:56,329 INFO L129 PetriNetUnfolder]: 2931/4437 cut-off events. [2020-10-15 23:58:56,329 INFO L130 PetriNetUnfolder]: For 1199/1199 co-relation queries the response was YES. [2020-10-15 23:58:56,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9307 conditions, 4437 events. 2931/4437 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23069 event pairs, 1532 based on Foata normal form. 2/3356 useless extension candidates. Maximal degree in co-relation 9280. Up to 2364 conditions per place. [2020-10-15 23:58:56,447 INFO L132 encePairwiseOnDemand]: 310/318 looper letters, 60 selfloop transitions, 6 changer transitions 2/110 dead transitions. [2020-10-15 23:58:56,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 542 flow [2020-10-15 23:58:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:58:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:58:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1156 transitions. [2020-10-15 23:58:56,473 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6058700209643606 [2020-10-15 23:58:56,474 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1156 transitions. [2020-10-15 23:58:56,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1156 transitions. [2020-10-15 23:58:56,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:58:56,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1156 transitions. [2020-10-15 23:58:56,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:58:56,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:58:56,506 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:58:56,508 INFO L185 Difference]: Start difference. First operand has 57 places, 77 transitions, 307 flow. Second operand 6 states and 1156 transitions. [2020-10-15 23:58:56,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 542 flow [2020-10-15 23:58:56,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 418 flow, removed 0 selfloop flow, removed 12 redundant places. [2020-10-15 23:58:56,534 INFO L241 Difference]: Finished difference. Result has 53 places, 80 transitions, 240 flow [2020-10-15 23:58:56,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=53, PETRI_TRANSITIONS=80} [2020-10-15 23:58:56,538 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2020-10-15 23:58:56,538 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 80 transitions, 240 flow [2020-10-15 23:58:56,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:58:56,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:58:56,538 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:58:56,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 23:58:56,539 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:58:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:58:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -238919695, now seen corresponding path program 2 times [2020-10-15 23:58:56,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:58:56,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622227530] [2020-10-15 23:58:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:58:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:58:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 23:58:56,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622227530] [2020-10-15 23:58:56,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:58:56,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:58:56,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134483272] [2020-10-15 23:58:56,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:58:56,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:58:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:58:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:58:56,648 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 318 [2020-10-15 23:58:56,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 80 transitions, 240 flow. Second operand 6 states. [2020-10-15 23:58:56,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:58:56,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 318 [2020-10-15 23:58:56,650 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:58:57,315 INFO L129 PetriNetUnfolder]: 3833/5728 cut-off events. [2020-10-15 23:58:57,316 INFO L130 PetriNetUnfolder]: For 744/746 co-relation queries the response was YES. [2020-10-15 23:58:57,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 5728 events. 3833/5728 cut-off events. For 744/746 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29741 event pairs, 1890 based on Foata normal form. 4/4389 useless extension candidates. Maximal degree in co-relation 8110. Up to 2409 conditions per place. [2020-10-15 23:58:57,365 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 82 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2020-10-15 23:58:57,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 133 transitions, 555 flow [2020-10-15 23:58:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:58:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:58:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1359 transitions. [2020-10-15 23:58:57,370 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.610512129380054 [2020-10-15 23:58:57,370 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1359 transitions. [2020-10-15 23:58:57,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1359 transitions. [2020-10-15 23:58:57,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:58:57,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1359 transitions. [2020-10-15 23:58:57,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:58:57,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:58:57,378 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:58:57,378 INFO L185 Difference]: Start difference. First operand has 53 places, 80 transitions, 240 flow. Second operand 7 states and 1359 transitions. [2020-10-15 23:58:57,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 133 transitions, 555 flow [2020-10-15 23:58:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 544 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-15 23:58:57,385 INFO L241 Difference]: Finished difference. Result has 59 places, 82 transitions, 272 flow [2020-10-15 23:58:57,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=59, PETRI_TRANSITIONS=82} [2020-10-15 23:58:57,386 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2020-10-15 23:58:57,386 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 82 transitions, 272 flow [2020-10-15 23:58:57,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:58:57,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:58:57,386 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:58:57,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 23:58:57,387 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:58:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:58:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash -394838610, now seen corresponding path program 1 times [2020-10-15 23:58:57,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:58:57,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796048577] [2020-10-15 23:58:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:58:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:58:57,459 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-15 23:58:57,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796048577] [2020-10-15 23:58:57,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:58:57,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 23:58:57,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391728805] [2020-10-15 23:58:57,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 23:58:57,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:58:57,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 23:58:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 23:58:57,465 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 318 [2020-10-15 23:58:57,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 82 transitions, 272 flow. Second operand 3 states. [2020-10-15 23:58:57,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:58:57,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 318 [2020-10-15 23:58:57,466 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:58:58,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][36], [84#ULTIMATE.startEXITtrue, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), 108#L1116-1true, Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 46#thread2EXITtrue, 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,052 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,052 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,052 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,052 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][34], [84#ULTIMATE.startEXITtrue, 37#thread2EXITtrue, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), 108#L1116-1true, Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,054 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,054 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,055 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][34], [84#ULTIMATE.startEXITtrue, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), 108#L1116-1true, Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 46#thread2EXITtrue, 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,055 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,055 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,055 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,056 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:58:58,065 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][35], [37#thread2EXITtrue, 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), 108#L1116-1true, Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 205#true]) [2020-10-15 23:58:58,065 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,066 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,066 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,066 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,068 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][35], [55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), 108#L1116-1true, Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 205#true, 189#true, 46#thread2EXITtrue]) [2020-10-15 23:58:58,068 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,068 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,068 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,068 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:58:58,072 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][34], [84#ULTIMATE.startEXITtrue, 8#L1117-1true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,073 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,073 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,073 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,073 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,076 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][34], [84#ULTIMATE.startEXITtrue, 8#L1117-1true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,076 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,076 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,076 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,076 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,077 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,077 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][35], [55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 8#L1117-1true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 189#true, 205#true]) [2020-10-15 23:58:58,077 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,077 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,077 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,077 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,078 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][35], [55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 8#L1117-1true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 205#true, 189#true]) [2020-10-15 23:58:58,080 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,081 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,085 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,085 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,088 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,093 INFO L129 PetriNetUnfolder]: 3404/5741 cut-off events. [2020-10-15 23:58:58,093 INFO L130 PetriNetUnfolder]: For 891/891 co-relation queries the response was YES. [2020-10-15 23:58:58,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9891 conditions, 5741 events. 3404/5741 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 36737 event pairs, 364 based on Foata normal form. 0/4345 useless extension candidates. Maximal degree in co-relation 5081. Up to 1967 conditions per place. [2020-10-15 23:58:58,147 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 28 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2020-10-15 23:58:58,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 374 flow [2020-10-15 23:58:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 23:58:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-15 23:58:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2020-10-15 23:58:58,150 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8364779874213837 [2020-10-15 23:58:58,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2020-10-15 23:58:58,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2020-10-15 23:58:58,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:58:58,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2020-10-15 23:58:58,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-15 23:58:58,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-15 23:58:58,155 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-15 23:58:58,155 INFO L185 Difference]: Start difference. First operand has 59 places, 82 transitions, 272 flow. Second operand 3 states and 798 transitions. [2020-10-15 23:58:58,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 374 flow [2020-10-15 23:58:58,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-15 23:58:58,161 INFO L241 Difference]: Finished difference. Result has 61 places, 90 transitions, 330 flow [2020-10-15 23:58:58,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=61, PETRI_TRANSITIONS=90} [2020-10-15 23:58:58,162 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2020-10-15 23:58:58,162 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 90 transitions, 330 flow [2020-10-15 23:58:58,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 23:58:58,162 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:58:58,162 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:58:58,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 23:58:58,163 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:58:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:58:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash -512769976, now seen corresponding path program 1 times [2020-10-15 23:58:58,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:58:58,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940888141] [2020-10-15 23:58:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:58:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:58:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 23:58:58,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940888141] [2020-10-15 23:58:58,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:58:58,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:58:58,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575064317] [2020-10-15 23:58:58,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:58:58,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:58:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:58:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:58:58,292 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 318 [2020-10-15 23:58:58,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 90 transitions, 330 flow. Second operand 6 states. [2020-10-15 23:58:58,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:58:58,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 318 [2020-10-15 23:58:58,293 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:58:58,928 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][45], [Black: 205#true, 84#ULTIMATE.startEXITtrue, 8#L1117-1true, Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 220#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset))]) [2020-10-15 23:58:58,928 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,929 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,929 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,929 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-15 23:58:58,943 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][46], [Black: 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 8#L1117-1true, Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 218#(and (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 191#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 205#true]) [2020-10-15 23:58:58,943 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,943 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,944 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,944 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-15 23:58:58,951 INFO L129 PetriNetUnfolder]: 3339/5660 cut-off events. [2020-10-15 23:58:58,951 INFO L130 PetriNetUnfolder]: For 2971/3319 co-relation queries the response was YES. [2020-10-15 23:58:58,976 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12372 conditions, 5660 events. 3339/5660 cut-off events. For 2971/3319 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 36493 event pairs, 354 based on Foata normal form. 144/4613 useless extension candidates. Maximal degree in co-relation 10083. Up to 1957 conditions per place. [2020-10-15 23:58:59,009 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 34 selfloop transitions, 12 changer transitions 4/107 dead transitions. [2020-10-15 23:58:59,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 505 flow [2020-10-15 23:58:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:58:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:58:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1447 transitions. [2020-10-15 23:58:59,014 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7583857442348009 [2020-10-15 23:58:59,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1447 transitions. [2020-10-15 23:58:59,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1447 transitions. [2020-10-15 23:58:59,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:58:59,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1447 transitions. [2020-10-15 23:58:59,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:58:59,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:58:59,022 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:58:59,022 INFO L185 Difference]: Start difference. First operand has 61 places, 90 transitions, 330 flow. Second operand 6 states and 1447 transitions. [2020-10-15 23:58:59,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 505 flow [2020-10-15 23:58:59,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-15 23:58:59,031 INFO L241 Difference]: Finished difference. Result has 67 places, 93 transitions, 382 flow [2020-10-15 23:58:59,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=67, PETRI_TRANSITIONS=93} [2020-10-15 23:58:59,031 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2020-10-15 23:58:59,032 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 93 transitions, 382 flow [2020-10-15 23:58:59,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:58:59,032 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:58:59,032 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:58:59,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 23:58:59,032 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:58:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:58:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1132603021, now seen corresponding path program 1 times [2020-10-15 23:58:59,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:58:59,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546063014] [2020-10-15 23:58:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:58:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:58:59,074 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-15 23:58:59,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546063014] [2020-10-15 23:58:59,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:58:59,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 23:58:59,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491390363] [2020-10-15 23:58:59,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 23:58:59,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:58:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 23:58:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 23:58:59,078 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 318 [2020-10-15 23:58:59,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 93 transitions, 382 flow. Second operand 5 states. [2020-10-15 23:58:59,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:58:59,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 318 [2020-10-15 23:58:59,080 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:00,282 INFO L129 PetriNetUnfolder]: 8480/12414 cut-off events. [2020-10-15 23:59:00,282 INFO L130 PetriNetUnfolder]: For 11930/12139 co-relation queries the response was YES. [2020-10-15 23:59:00,335 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31729 conditions, 12414 events. 8480/12414 cut-off events. For 11930/12139 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 71459 event pairs, 2113 based on Foata normal form. 78/9534 useless extension candidates. Maximal degree in co-relation 26392. Up to 8376 conditions per place. [2020-10-15 23:59:00,378 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 91 selfloop transitions, 7 changer transitions 1/138 dead transitions. [2020-10-15 23:59:00,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 138 transitions, 780 flow [2020-10-15 23:59:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:59:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:59:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2020-10-15 23:59:00,383 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7154088050314465 [2020-10-15 23:59:00,383 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1365 transitions. [2020-10-15 23:59:00,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1365 transitions. [2020-10-15 23:59:00,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:00,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1365 transitions. [2020-10-15 23:59:00,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:59:00,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:59:00,391 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:59:00,391 INFO L185 Difference]: Start difference. First operand has 67 places, 93 transitions, 382 flow. Second operand 6 states and 1365 transitions. [2020-10-15 23:59:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 138 transitions, 780 flow [2020-10-15 23:59:00,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 138 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:00,407 INFO L241 Difference]: Finished difference. Result has 72 places, 97 transitions, 424 flow [2020-10-15 23:59:00,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=72, PETRI_TRANSITIONS=97} [2020-10-15 23:59:00,408 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2020-10-15 23:59:00,408 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 97 transitions, 424 flow [2020-10-15 23:59:00,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 23:59:00,408 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:00,409 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:00,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 23:59:00,409 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash 504160415, now seen corresponding path program 2 times [2020-10-15 23:59:00,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:00,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773950940] [2020-10-15 23:59:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:00,464 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-15 23:59:00,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773950940] [2020-10-15 23:59:00,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:00,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:59:00,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049915672] [2020-10-15 23:59:00,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:59:00,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:59:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:59:00,468 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 318 [2020-10-15 23:59:00,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 97 transitions, 424 flow. Second operand 6 states. [2020-10-15 23:59:00,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:00,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 318 [2020-10-15 23:59:00,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:01,627 INFO L129 PetriNetUnfolder]: 8294/12217 cut-off events. [2020-10-15 23:59:01,627 INFO L130 PetriNetUnfolder]: For 13039/13252 co-relation queries the response was YES. [2020-10-15 23:59:01,680 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31829 conditions, 12217 events. 8294/12217 cut-off events. For 13039/13252 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 70107 event pairs, 1726 based on Foata normal form. 158/9516 useless extension candidates. Maximal degree in co-relation 26076. Up to 4969 conditions per place. [2020-10-15 23:59:01,717 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 89 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2020-10-15 23:59:01,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 141 transitions, 825 flow [2020-10-15 23:59:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:59:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:59:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2020-10-15 23:59:01,721 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6074423480083857 [2020-10-15 23:59:01,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1159 transitions. [2020-10-15 23:59:01,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1159 transitions. [2020-10-15 23:59:01,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:01,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1159 transitions. [2020-10-15 23:59:01,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:59:01,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:59:01,728 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:59:01,728 INFO L185 Difference]: Start difference. First operand has 72 places, 97 transitions, 424 flow. Second operand 6 states and 1159 transitions. [2020-10-15 23:59:01,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 141 transitions, 825 flow [2020-10-15 23:59:01,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 141 transitions, 797 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:01,745 INFO L241 Difference]: Finished difference. Result has 77 places, 100 transitions, 471 flow [2020-10-15 23:59:01,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=77, PETRI_TRANSITIONS=100} [2020-10-15 23:59:01,746 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2020-10-15 23:59:01,746 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 100 transitions, 471 flow [2020-10-15 23:59:01,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:59:01,746 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:01,746 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:01,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 23:59:01,746 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 783113725, now seen corresponding path program 3 times [2020-10-15 23:59:01,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:01,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117004016] [2020-10-15 23:59:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:01,831 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-15 23:59:01,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117004016] [2020-10-15 23:59:01,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:01,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 23:59:01,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950449269] [2020-10-15 23:59:01,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 23:59:01,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:01,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 23:59:01,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 23:59:01,836 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 318 [2020-10-15 23:59:01,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 100 transitions, 471 flow. Second operand 8 states. [2020-10-15 23:59:01,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:01,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 318 [2020-10-15 23:59:01,838 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:03,795 INFO L129 PetriNetUnfolder]: 11491/16689 cut-off events. [2020-10-15 23:59:03,795 INFO L130 PetriNetUnfolder]: For 18007/18161 co-relation queries the response was YES. [2020-10-15 23:59:03,841 INFO L80 FinitePrefix]: Finished finitePrefix Result has 43145 conditions, 16689 events. 11491/16689 cut-off events. For 18007/18161 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 97967 event pairs, 2377 based on Foata normal form. 80/12762 useless extension candidates. Maximal degree in co-relation 36043. Up to 5960 conditions per place. [2020-10-15 23:59:03,893 INFO L132 encePairwiseOnDemand]: 308/318 looper letters, 123 selfloop transitions, 30 changer transitions 0/189 dead transitions. [2020-10-15 23:59:03,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 189 transitions, 1186 flow [2020-10-15 23:59:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 23:59:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-15 23:59:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1712 transitions. [2020-10-15 23:59:03,899 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5981830887491265 [2020-10-15 23:59:03,899 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1712 transitions. [2020-10-15 23:59:03,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1712 transitions. [2020-10-15 23:59:03,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:03,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1712 transitions. [2020-10-15 23:59:03,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-15 23:59:03,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-15 23:59:03,908 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-15 23:59:03,908 INFO L185 Difference]: Start difference. First operand has 77 places, 100 transitions, 471 flow. Second operand 9 states and 1712 transitions. [2020-10-15 23:59:03,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 189 transitions, 1186 flow [2020-10-15 23:59:03,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 189 transitions, 1157 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-15 23:59:03,928 INFO L241 Difference]: Finished difference. Result has 86 places, 116 transitions, 688 flow [2020-10-15 23:59:03,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=688, PETRI_PLACES=86, PETRI_TRANSITIONS=116} [2020-10-15 23:59:03,929 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2020-10-15 23:59:03,929 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 116 transitions, 688 flow [2020-10-15 23:59:03,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 23:59:03,929 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:03,929 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:03,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 23:59:03,929 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:03,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1088477028, now seen corresponding path program 1 times [2020-10-15 23:59:03,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:03,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748282691] [2020-10-15 23:59:03,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:04,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-15 23:59:04,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748282691] [2020-10-15 23:59:04,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:04,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 23:59:04,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128124971] [2020-10-15 23:59:04,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 23:59:04,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 23:59:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 23:59:04,012 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 318 [2020-10-15 23:59:04,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 116 transitions, 688 flow. Second operand 8 states. [2020-10-15 23:59:04,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:04,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 318 [2020-10-15 23:59:04,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:05,404 INFO L129 PetriNetUnfolder]: 10905/16066 cut-off events. [2020-10-15 23:59:05,404 INFO L130 PetriNetUnfolder]: For 29366/29553 co-relation queries the response was YES. [2020-10-15 23:59:05,470 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44939 conditions, 16066 events. 10905/16066 cut-off events. For 29366/29553 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 96725 event pairs, 2593 based on Foata normal form. 79/12334 useless extension candidates. Maximal degree in co-relation 34685. Up to 11018 conditions per place. [2020-10-15 23:59:05,522 INFO L132 encePairwiseOnDemand]: 308/318 looper letters, 97 selfloop transitions, 20 changer transitions 0/153 dead transitions. [2020-10-15 23:59:05,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1117 flow [2020-10-15 23:59:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:59:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:59:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1320 transitions. [2020-10-15 23:59:05,526 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5929919137466307 [2020-10-15 23:59:05,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1320 transitions. [2020-10-15 23:59:05,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1320 transitions. [2020-10-15 23:59:05,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:05,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1320 transitions. [2020-10-15 23:59:05,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:59:05,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:59:05,533 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:59:05,534 INFO L185 Difference]: Start difference. First operand has 86 places, 116 transitions, 688 flow. Second operand 7 states and 1320 transitions. [2020-10-15 23:59:05,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1117 flow [2020-10-15 23:59:05,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1087 flow, removed 11 selfloop flow, removed 3 redundant places. [2020-10-15 23:59:05,569 INFO L241 Difference]: Finished difference. Result has 92 places, 121 transitions, 782 flow [2020-10-15 23:59:05,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=782, PETRI_PLACES=92, PETRI_TRANSITIONS=121} [2020-10-15 23:59:05,570 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2020-10-15 23:59:05,570 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 121 transitions, 782 flow [2020-10-15 23:59:05,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 23:59:05,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:05,571 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:05,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 23:59:05,571 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1121538311, now seen corresponding path program 4 times [2020-10-15 23:59:05,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:05,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199481423] [2020-10-15 23:59:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:05,689 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-15 23:59:05,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199481423] [2020-10-15 23:59:05,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:05,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 23:59:05,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152048938] [2020-10-15 23:59:05,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 23:59:05,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 23:59:05,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 23:59:05,693 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 318 [2020-10-15 23:59:05,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 121 transitions, 782 flow. Second operand 10 states. [2020-10-15 23:59:05,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:05,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 318 [2020-10-15 23:59:05,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:07,629 INFO L129 PetriNetUnfolder]: 16431/24115 cut-off events. [2020-10-15 23:59:07,630 INFO L130 PetriNetUnfolder]: For 40639/40846 co-relation queries the response was YES. [2020-10-15 23:59:07,732 INFO L80 FinitePrefix]: Finished finitePrefix Result has 65169 conditions, 24115 events. 16431/24115 cut-off events. For 40639/40846 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 153073 event pairs, 3699 based on Foata normal form. 81/18176 useless extension candidates. Maximal degree in co-relation 57761. Up to 8142 conditions per place. [2020-10-15 23:59:07,786 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 134 selfloop transitions, 24 changer transitions 0/194 dead transitions. [2020-10-15 23:59:07,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 194 transitions, 1455 flow [2020-10-15 23:59:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 23:59:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-15 23:59:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1503 transitions. [2020-10-15 23:59:07,790 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5908018867924528 [2020-10-15 23:59:07,790 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1503 transitions. [2020-10-15 23:59:07,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1503 transitions. [2020-10-15 23:59:07,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:07,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1503 transitions. [2020-10-15 23:59:07,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-15 23:59:07,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-15 23:59:07,798 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-15 23:59:07,798 INFO L185 Difference]: Start difference. First operand has 92 places, 121 transitions, 782 flow. Second operand 8 states and 1503 transitions. [2020-10-15 23:59:07,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 194 transitions, 1455 flow [2020-10-15 23:59:07,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 194 transitions, 1424 flow, removed 9 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:07,839 INFO L241 Difference]: Finished difference. Result has 99 places, 125 transitions, 851 flow [2020-10-15 23:59:07,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=99, PETRI_TRANSITIONS=125} [2020-10-15 23:59:07,840 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2020-10-15 23:59:07,840 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 125 transitions, 851 flow [2020-10-15 23:59:07,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 23:59:07,840 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:07,840 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-15 23:59:07,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 23:59:07,840 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash -302192283, now seen corresponding path program 1 times [2020-10-15 23:59:07,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:07,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247073902] [2020-10-15 23:59:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 23:59:07,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247073902] [2020-10-15 23:59:07,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:07,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:59:07,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122080677] [2020-10-15 23:59:07,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:59:07,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:59:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:59:07,902 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 318 [2020-10-15 23:59:07,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 125 transitions, 851 flow. Second operand 6 states. [2020-10-15 23:59:07,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:07,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 318 [2020-10-15 23:59:07,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:09,477 INFO L129 PetriNetUnfolder]: 14525/21948 cut-off events. [2020-10-15 23:59:09,478 INFO L130 PetriNetUnfolder]: For 38433/38608 co-relation queries the response was YES. [2020-10-15 23:59:09,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 59231 conditions, 21948 events. 14525/21948 cut-off events. For 38433/38608 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 145057 event pairs, 3594 based on Foata normal form. 416/16887 useless extension candidates. Maximal degree in co-relation 50939. Up to 10434 conditions per place. [2020-10-15 23:59:09,649 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 108 selfloop transitions, 11 changer transitions 0/163 dead transitions. [2020-10-15 23:59:09,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 1278 flow [2020-10-15 23:59:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:59:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:59:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1153 transitions. [2020-10-15 23:59:09,652 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6042976939203354 [2020-10-15 23:59:09,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1153 transitions. [2020-10-15 23:59:09,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1153 transitions. [2020-10-15 23:59:09,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:09,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1153 transitions. [2020-10-15 23:59:09,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:59:09,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:59:09,657 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:59:09,658 INFO L185 Difference]: Start difference. First operand has 99 places, 125 transitions, 851 flow. Second operand 6 states and 1153 transitions. [2020-10-15 23:59:09,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 1278 flow [2020-10-15 23:59:09,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 163 transitions, 1238 flow, removed 2 selfloop flow, removed 5 redundant places. [2020-10-15 23:59:09,694 INFO L241 Difference]: Finished difference. Result has 101 places, 123 transitions, 822 flow [2020-10-15 23:59:09,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=822, PETRI_PLACES=101, PETRI_TRANSITIONS=123} [2020-10-15 23:59:09,695 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2020-10-15 23:59:09,695 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 123 transitions, 822 flow [2020-10-15 23:59:09,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:59:09,695 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:09,695 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-15 23:59:09,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 23:59:09,695 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1691999831, now seen corresponding path program 2 times [2020-10-15 23:59:09,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:09,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871222265] [2020-10-15 23:59:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:09,759 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-15 23:59:09,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871222265] [2020-10-15 23:59:09,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:09,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 23:59:09,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942849448] [2020-10-15 23:59:09,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 23:59:09,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:09,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 23:59:09,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 23:59:09,763 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 318 [2020-10-15 23:59:09,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 123 transitions, 822 flow. Second operand 7 states. [2020-10-15 23:59:09,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:09,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 318 [2020-10-15 23:59:09,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:11,847 INFO L129 PetriNetUnfolder]: 18823/28280 cut-off events. [2020-10-15 23:59:11,847 INFO L130 PetriNetUnfolder]: For 50098/50318 co-relation queries the response was YES. [2020-10-15 23:59:12,011 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77389 conditions, 28280 events. 18823/28280 cut-off events. For 50098/50318 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 191228 event pairs, 4287 based on Foata normal form. 140/21235 useless extension candidates. Maximal degree in co-relation 68935. Up to 10926 conditions per place. [2020-10-15 23:59:12,100 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 147 selfloop transitions, 21 changer transitions 0/211 dead transitions. [2020-10-15 23:59:12,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 211 transitions, 1673 flow [2020-10-15 23:59:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 23:59:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-15 23:59:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1711 transitions. [2020-10-15 23:59:12,105 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5978336827393431 [2020-10-15 23:59:12,106 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1711 transitions. [2020-10-15 23:59:12,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1711 transitions. [2020-10-15 23:59:12,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:12,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1711 transitions. [2020-10-15 23:59:12,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-15 23:59:12,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-15 23:59:12,114 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-15 23:59:12,115 INFO L185 Difference]: Start difference. First operand has 101 places, 123 transitions, 822 flow. Second operand 9 states and 1711 transitions. [2020-10-15 23:59:12,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 211 transitions, 1673 flow [2020-10-15 23:59:12,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 211 transitions, 1654 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-15 23:59:12,209 INFO L241 Difference]: Finished difference. Result has 110 places, 133 transitions, 983 flow [2020-10-15 23:59:12,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=983, PETRI_PLACES=110, PETRI_TRANSITIONS=133} [2020-10-15 23:59:12,210 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2020-10-15 23:59:12,210 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 133 transitions, 983 flow [2020-10-15 23:59:12,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 23:59:12,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:12,210 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-15 23:59:12,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 23:59:12,211 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 339617523, now seen corresponding path program 3 times [2020-10-15 23:59:12,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:12,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583358159] [2020-10-15 23:59:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:12,281 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-15 23:59:12,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583358159] [2020-10-15 23:59:12,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:12,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 23:59:12,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644236007] [2020-10-15 23:59:12,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 23:59:12,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 23:59:12,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 23:59:12,286 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 318 [2020-10-15 23:59:12,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 133 transitions, 983 flow. Second operand 7 states. [2020-10-15 23:59:12,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:12,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 318 [2020-10-15 23:59:12,287 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:14,379 INFO L129 PetriNetUnfolder]: 17692/26956 cut-off events. [2020-10-15 23:59:14,379 INFO L130 PetriNetUnfolder]: For 51391/51634 co-relation queries the response was YES. [2020-10-15 23:59:14,556 INFO L80 FinitePrefix]: Finished finitePrefix Result has 75731 conditions, 26956 events. 17692/26956 cut-off events. For 51391/51634 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 186091 event pairs, 4177 based on Foata normal form. 138/20315 useless extension candidates. Maximal degree in co-relation 68433. Up to 17731 conditions per place. [2020-10-15 23:59:14,621 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 113 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2020-10-15 23:59:14,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 1447 flow [2020-10-15 23:59:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:59:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:59:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1321 transitions. [2020-10-15 23:59:14,624 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5934411500449236 [2020-10-15 23:59:14,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1321 transitions. [2020-10-15 23:59:14,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1321 transitions. [2020-10-15 23:59:14,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:14,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1321 transitions. [2020-10-15 23:59:14,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:59:14,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:59:14,630 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:59:14,630 INFO L185 Difference]: Start difference. First operand has 110 places, 133 transitions, 983 flow. Second operand 7 states and 1321 transitions. [2020-10-15 23:59:14,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 1447 flow [2020-10-15 23:59:14,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 170 transitions, 1426 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:14,686 INFO L241 Difference]: Finished difference. Result has 116 places, 133 transitions, 1009 flow [2020-10-15 23:59:14,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=116, PETRI_TRANSITIONS=133} [2020-10-15 23:59:14,686 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2020-10-15 23:59:14,686 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 133 transitions, 1009 flow [2020-10-15 23:59:14,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 23:59:14,687 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:14,687 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-15 23:59:14,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 23:59:14,687 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1438578944, now seen corresponding path program 1 times [2020-10-15 23:59:14,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:14,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562848521] [2020-10-15 23:59:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:14,848 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-15 23:59:14,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562848521] [2020-10-15 23:59:14,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:14,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 23:59:14,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210500367] [2020-10-15 23:59:14,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 23:59:14,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 23:59:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-15 23:59:14,853 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 318 [2020-10-15 23:59:14,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 133 transitions, 1009 flow. Second operand 11 states. [2020-10-15 23:59:14,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:14,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 318 [2020-10-15 23:59:14,854 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:17,014 INFO L129 PetriNetUnfolder]: 16453/25180 cut-off events. [2020-10-15 23:59:17,015 INFO L130 PetriNetUnfolder]: For 49593/49794 co-relation queries the response was YES. [2020-10-15 23:59:17,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69706 conditions, 25180 events. 16453/25180 cut-off events. For 49593/49794 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 173109 event pairs, 3413 based on Foata normal form. 350/19300 useless extension candidates. Maximal degree in co-relation 62708. Up to 10417 conditions per place. [2020-10-15 23:59:17,229 INFO L132 encePairwiseOnDemand]: 305/318 looper letters, 101 selfloop transitions, 48 changer transitions 10/202 dead transitions. [2020-10-15 23:59:17,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 202 transitions, 1751 flow [2020-10-15 23:59:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 23:59:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-15 23:59:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2013 transitions. [2020-10-15 23:59:17,238 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2020-10-15 23:59:17,238 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2013 transitions. [2020-10-15 23:59:17,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2013 transitions. [2020-10-15 23:59:17,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:17,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2013 transitions. [2020-10-15 23:59:17,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-15 23:59:17,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-15 23:59:17,250 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-15 23:59:17,250 INFO L185 Difference]: Start difference. First operand has 116 places, 133 transitions, 1009 flow. Second operand 11 states and 2013 transitions. [2020-10-15 23:59:17,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 202 transitions, 1751 flow [2020-10-15 23:59:17,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 202 transitions, 1686 flow, removed 8 selfloop flow, removed 9 redundant places. [2020-10-15 23:59:17,305 INFO L241 Difference]: Finished difference. Result has 117 places, 142 transitions, 1136 flow [2020-10-15 23:59:17,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1136, PETRI_PLACES=117, PETRI_TRANSITIONS=142} [2020-10-15 23:59:17,305 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 60 predicate places. [2020-10-15 23:59:17,305 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 142 transitions, 1136 flow [2020-10-15 23:59:17,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 23:59:17,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:17,306 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-15 23:59:17,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 23:59:17,306 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1405505168, now seen corresponding path program 1 times [2020-10-15 23:59:17,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:17,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089149189] [2020-10-15 23:59:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:17,425 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-15 23:59:17,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089149189] [2020-10-15 23:59:17,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:17,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 23:59:17,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112790416] [2020-10-15 23:59:17,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 23:59:17,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 23:59:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 23:59:17,431 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 318 [2020-10-15 23:59:17,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 142 transitions, 1136 flow. Second operand 10 states. [2020-10-15 23:59:17,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:17,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 318 [2020-10-15 23:59:17,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:19,498 INFO L129 PetriNetUnfolder]: 17582/26774 cut-off events. [2020-10-15 23:59:19,499 INFO L130 PetriNetUnfolder]: For 53086/53318 co-relation queries the response was YES. [2020-10-15 23:59:19,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 72864 conditions, 26774 events. 17582/26774 cut-off events. For 53086/53318 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 185162 event pairs, 3765 based on Foata normal form. 45/20099 useless extension candidates. Maximal degree in co-relation 63576. Up to 16906 conditions per place. [2020-10-15 23:59:19,709 INFO L132 encePairwiseOnDemand]: 308/318 looper letters, 123 selfloop transitions, 32 changer transitions 0/193 dead transitions. [2020-10-15 23:59:19,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 193 transitions, 1779 flow [2020-10-15 23:59:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 23:59:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-15 23:59:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1467 transitions. [2020-10-15 23:59:19,713 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5766509433962265 [2020-10-15 23:59:19,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1467 transitions. [2020-10-15 23:59:19,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1467 transitions. [2020-10-15 23:59:19,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:19,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1467 transitions. [2020-10-15 23:59:19,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-15 23:59:19,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-15 23:59:19,720 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-15 23:59:19,720 INFO L185 Difference]: Start difference. First operand has 117 places, 142 transitions, 1136 flow. Second operand 8 states and 1467 transitions. [2020-10-15 23:59:19,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 193 transitions, 1779 flow [2020-10-15 23:59:19,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 193 transitions, 1735 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-15 23:59:19,778 INFO L241 Difference]: Finished difference. Result has 123 places, 153 transitions, 1321 flow [2020-10-15 23:59:19,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1321, PETRI_PLACES=123, PETRI_TRANSITIONS=153} [2020-10-15 23:59:19,779 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2020-10-15 23:59:19,779 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 153 transitions, 1321 flow [2020-10-15 23:59:19,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 23:59:19,779 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:19,779 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-15 23:59:19,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 23:59:19,780 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1100148592, now seen corresponding path program 2 times [2020-10-15 23:59:19,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:19,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192719827] [2020-10-15 23:59:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:19,897 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-15 23:59:19,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192719827] [2020-10-15 23:59:19,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:19,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 23:59:19,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666472972] [2020-10-15 23:59:19,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 23:59:19,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 23:59:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 23:59:19,901 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 318 [2020-10-15 23:59:19,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 153 transitions, 1321 flow. Second operand 10 states. [2020-10-15 23:59:19,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:19,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 318 [2020-10-15 23:59:19,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:22,323 INFO L129 PetriNetUnfolder]: 18697/28117 cut-off events. [2020-10-15 23:59:22,323 INFO L130 PetriNetUnfolder]: For 59133/59458 co-relation queries the response was YES. [2020-10-15 23:59:22,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77952 conditions, 28117 events. 18697/28117 cut-off events. For 59133/59458 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 192279 event pairs, 4197 based on Foata normal form. 47/20985 useless extension candidates. Maximal degree in co-relation 68293. Up to 11539 conditions per place. [2020-10-15 23:59:22,561 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 139 selfloop transitions, 52 changer transitions 0/229 dead transitions. [2020-10-15 23:59:22,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 229 transitions, 2115 flow [2020-10-15 23:59:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 23:59:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-15 23:59:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2012 transitions. [2020-10-15 23:59:22,568 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5751858204688394 [2020-10-15 23:59:22,568 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2012 transitions. [2020-10-15 23:59:22,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2012 transitions. [2020-10-15 23:59:22,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:22,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2012 transitions. [2020-10-15 23:59:22,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-15 23:59:22,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-15 23:59:22,577 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-15 23:59:22,577 INFO L185 Difference]: Start difference. First operand has 123 places, 153 transitions, 1321 flow. Second operand 11 states and 2012 transitions. [2020-10-15 23:59:22,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 229 transitions, 2115 flow [2020-10-15 23:59:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 229 transitions, 2057 flow, removed 1 selfloop flow, removed 5 redundant places. [2020-10-15 23:59:22,646 INFO L241 Difference]: Finished difference. Result has 132 places, 160 transitions, 1524 flow [2020-10-15 23:59:22,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1524, PETRI_PLACES=132, PETRI_TRANSITIONS=160} [2020-10-15 23:59:22,647 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 75 predicate places. [2020-10-15 23:59:22,647 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 1524 flow [2020-10-15 23:59:22,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 23:59:22,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:22,647 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:22,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 23:59:22,647 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 909951002, now seen corresponding path program 1 times [2020-10-15 23:59:22,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:22,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105675652] [2020-10-15 23:59:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:22,842 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-15 23:59:22,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105675652] [2020-10-15 23:59:22,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:22,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 23:59:22,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708011956] [2020-10-15 23:59:22,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 23:59:22,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 23:59:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-15 23:59:22,847 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 318 [2020-10-15 23:59:22,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 160 transitions, 1524 flow. Second operand 12 states. [2020-10-15 23:59:22,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:22,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 318 [2020-10-15 23:59:22,848 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:25,962 INFO L129 PetriNetUnfolder]: 20162/30711 cut-off events. [2020-10-15 23:59:25,962 INFO L130 PetriNetUnfolder]: For 75460/75522 co-relation queries the response was YES. [2020-10-15 23:59:26,180 INFO L80 FinitePrefix]: Finished finitePrefix Result has 87394 conditions, 30711 events. 20162/30711 cut-off events. For 75460/75522 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 216485 event pairs, 3474 based on Foata normal form. 63/22982 useless extension candidates. Maximal degree in co-relation 77670. Up to 17924 conditions per place. [2020-10-15 23:59:26,251 INFO L132 encePairwiseOnDemand]: 305/318 looper letters, 147 selfloop transitions, 69 changer transitions 0/254 dead transitions. [2020-10-15 23:59:26,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 254 transitions, 2737 flow [2020-10-15 23:59:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 23:59:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-15 23:59:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2185 transitions. [2020-10-15 23:59:26,255 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5725890985324947 [2020-10-15 23:59:26,255 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2185 transitions. [2020-10-15 23:59:26,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2185 transitions. [2020-10-15 23:59:26,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:26,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2185 transitions. [2020-10-15 23:59:26,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-15 23:59:26,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-15 23:59:26,261 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-15 23:59:26,261 INFO L185 Difference]: Start difference. First operand has 132 places, 160 transitions, 1524 flow. Second operand 12 states and 2185 transitions. [2020-10-15 23:59:26,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 254 transitions, 2737 flow [2020-10-15 23:59:26,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 254 transitions, 2669 flow, removed 6 selfloop flow, removed 4 redundant places. [2020-10-15 23:59:26,327 INFO L241 Difference]: Finished difference. Result has 145 places, 194 transitions, 2094 flow [2020-10-15 23:59:26,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2094, PETRI_PLACES=145, PETRI_TRANSITIONS=194} [2020-10-15 23:59:26,328 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2020-10-15 23:59:26,328 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 194 transitions, 2094 flow [2020-10-15 23:59:26,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 23:59:26,328 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:26,328 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:26,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 23:59:26,328 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 876882992, now seen corresponding path program 2 times [2020-10-15 23:59:26,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:26,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615258490] [2020-10-15 23:59:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:26,484 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-15 23:59:26,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615258490] [2020-10-15 23:59:26,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:26,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 23:59:26,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081691293] [2020-10-15 23:59:26,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 23:59:26,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 23:59:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-15 23:59:26,489 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 318 [2020-10-15 23:59:26,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 194 transitions, 2094 flow. Second operand 11 states. [2020-10-15 23:59:26,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:26,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 318 [2020-10-15 23:59:26,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:30,564 INFO L129 PetriNetUnfolder]: 19948/30183 cut-off events. [2020-10-15 23:59:30,564 INFO L130 PetriNetUnfolder]: For 110017/110343 co-relation queries the response was YES. [2020-10-15 23:59:30,799 INFO L80 FinitePrefix]: Finished finitePrefix Result has 92354 conditions, 30183 events. 19948/30183 cut-off events. For 110017/110343 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 210282 event pairs, 3736 based on Foata normal form. 62/22571 useless extension candidates. Maximal degree in co-relation 81980. Up to 14934 conditions per place. [2020-10-15 23:59:30,858 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 137 selfloop transitions, 67 changer transitions 11/253 dead transitions. [2020-10-15 23:59:30,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 253 transitions, 2901 flow [2020-10-15 23:59:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 23:59:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-15 23:59:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1984 transitions. [2020-10-15 23:59:30,860 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5671812464265295 [2020-10-15 23:59:30,860 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1984 transitions. [2020-10-15 23:59:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1984 transitions. [2020-10-15 23:59:30,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:30,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1984 transitions. [2020-10-15 23:59:30,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-15 23:59:30,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-15 23:59:30,865 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-15 23:59:30,865 INFO L185 Difference]: Start difference. First operand has 145 places, 194 transitions, 2094 flow. Second operand 11 states and 1984 transitions. [2020-10-15 23:59:30,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 253 transitions, 2901 flow [2020-10-15 23:59:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 253 transitions, 2773 flow, removed 23 selfloop flow, removed 8 redundant places. [2020-10-15 23:59:30,963 INFO L241 Difference]: Finished difference. Result has 147 places, 190 transitions, 2042 flow [2020-10-15 23:59:30,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2042, PETRI_PLACES=147, PETRI_TRANSITIONS=190} [2020-10-15 23:59:30,964 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 90 predicate places. [2020-10-15 23:59:30,964 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 190 transitions, 2042 flow [2020-10-15 23:59:30,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 23:59:30,964 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:30,964 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:30,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 23:59:30,964 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 366507977, now seen corresponding path program 1 times [2020-10-15 23:59:30,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:30,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006845858] [2020-10-15 23:59:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:31,007 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-15 23:59:31,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006845858] [2020-10-15 23:59:31,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:31,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:59:31,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499478367] [2020-10-15 23:59:31,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:59:31,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:59:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:59:31,010 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 318 [2020-10-15 23:59:31,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 190 transitions, 2042 flow. Second operand 6 states. [2020-10-15 23:59:31,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:31,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 318 [2020-10-15 23:59:31,011 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:33,817 INFO L129 PetriNetUnfolder]: 17445/27003 cut-off events. [2020-10-15 23:59:33,817 INFO L130 PetriNetUnfolder]: For 99185/99316 co-relation queries the response was YES. [2020-10-15 23:59:33,987 INFO L80 FinitePrefix]: Finished finitePrefix Result has 81315 conditions, 27003 events. 17445/27003 cut-off events. For 99185/99316 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 193056 event pairs, 3780 based on Foata normal form. 330/20453 useless extension candidates. Maximal degree in co-relation 74460. Up to 15339 conditions per place. [2020-10-15 23:59:34,056 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 184 selfloop transitions, 12 changer transitions 0/243 dead transitions. [2020-10-15 23:59:34,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 243 transitions, 2898 flow [2020-10-15 23:59:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 23:59:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-15 23:59:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2020-10-15 23:59:34,058 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6022012578616353 [2020-10-15 23:59:34,058 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1149 transitions. [2020-10-15 23:59:34,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1149 transitions. [2020-10-15 23:59:34,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:34,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1149 transitions. [2020-10-15 23:59:34,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-15 23:59:34,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-15 23:59:34,061 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-15 23:59:34,061 INFO L185 Difference]: Start difference. First operand has 147 places, 190 transitions, 2042 flow. Second operand 6 states and 1149 transitions. [2020-10-15 23:59:34,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 243 transitions, 2898 flow [2020-10-15 23:59:34,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 243 transitions, 2776 flow, removed 9 selfloop flow, removed 9 redundant places. [2020-10-15 23:59:34,159 INFO L241 Difference]: Finished difference. Result has 145 places, 191 transitions, 1969 flow [2020-10-15 23:59:34,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1969, PETRI_PLACES=145, PETRI_TRANSITIONS=191} [2020-10-15 23:59:34,160 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2020-10-15 23:59:34,160 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 191 transitions, 1969 flow [2020-10-15 23:59:34,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:59:34,160 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:34,160 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:34,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 23:59:34,160 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash -99777349, now seen corresponding path program 2 times [2020-10-15 23:59:34,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:34,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998737341] [2020-10-15 23:59:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 23:59:34,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998737341] [2020-10-15 23:59:34,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:34,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 23:59:34,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008981802] [2020-10-15 23:59:34,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 23:59:34,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 23:59:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 23:59:34,226 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 318 [2020-10-15 23:59:34,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 191 transitions, 1969 flow. Second operand 7 states. [2020-10-15 23:59:34,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:34,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 318 [2020-10-15 23:59:34,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:36,478 INFO L129 PetriNetUnfolder]: 16671/26025 cut-off events. [2020-10-15 23:59:36,478 INFO L130 PetriNetUnfolder]: For 95600/95699 co-relation queries the response was YES. [2020-10-15 23:59:36,687 INFO L80 FinitePrefix]: Finished finitePrefix Result has 78638 conditions, 26025 events. 16671/26025 cut-off events. For 95600/95699 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 187506 event pairs, 3711 based on Foata normal form. 222/19689 useless extension candidates. Maximal degree in co-relation 71944. Up to 11902 conditions per place. [2020-10-15 23:59:36,761 INFO L132 encePairwiseOnDemand]: 308/318 looper letters, 171 selfloop transitions, 26 changer transitions 0/243 dead transitions. [2020-10-15 23:59:36,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 243 transitions, 2799 flow [2020-10-15 23:59:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 23:59:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-15 23:59:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1856 transitions. [2020-10-15 23:59:36,763 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5836477987421383 [2020-10-15 23:59:36,763 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1856 transitions. [2020-10-15 23:59:36,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1856 transitions. [2020-10-15 23:59:36,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:36,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1856 transitions. [2020-10-15 23:59:36,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-15 23:59:36,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-15 23:59:36,768 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-15 23:59:36,768 INFO L185 Difference]: Start difference. First operand has 145 places, 191 transitions, 1969 flow. Second operand 10 states and 1856 transitions. [2020-10-15 23:59:36,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 243 transitions, 2799 flow [2020-10-15 23:59:36,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 243 transitions, 2775 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-15 23:59:36,871 INFO L241 Difference]: Finished difference. Result has 152 places, 192 transitions, 2022 flow [2020-10-15 23:59:36,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2022, PETRI_PLACES=152, PETRI_TRANSITIONS=192} [2020-10-15 23:59:36,871 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places. [2020-10-15 23:59:36,871 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 192 transitions, 2022 flow [2020-10-15 23:59:36,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 23:59:36,871 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:36,871 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:36,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 23:59:36,872 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash -97151573, now seen corresponding path program 3 times [2020-10-15 23:59:36,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:36,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259467884] [2020-10-15 23:59:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:36,941 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-15 23:59:36,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259467884] [2020-10-15 23:59:36,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:36,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 23:59:36,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536123376] [2020-10-15 23:59:36,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 23:59:36,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:36,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 23:59:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 23:59:36,944 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 318 [2020-10-15 23:59:36,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 192 transitions, 2022 flow. Second operand 8 states. [2020-10-15 23:59:36,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:36,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 318 [2020-10-15 23:59:36,945 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:40,233 INFO L129 PetriNetUnfolder]: 16043/25218 cut-off events. [2020-10-15 23:59:40,233 INFO L130 PetriNetUnfolder]: For 94879/94947 co-relation queries the response was YES. [2020-10-15 23:59:40,440 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77470 conditions, 25218 events. 16043/25218 cut-off events. For 94879/94947 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 182303 event pairs, 3480 based on Foata normal form. 178/19082 useless extension candidates. Maximal degree in co-relation 70398. Up to 9057 conditions per place. [2020-10-15 23:59:40,508 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 159 selfloop transitions, 45 changer transitions 0/250 dead transitions. [2020-10-15 23:59:40,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 250 transitions, 2895 flow [2020-10-15 23:59:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 23:59:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-15 23:59:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1852 transitions. [2020-10-15 23:59:40,510 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5823899371069182 [2020-10-15 23:59:40,511 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1852 transitions. [2020-10-15 23:59:40,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1852 transitions. [2020-10-15 23:59:40,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:40,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1852 transitions. [2020-10-15 23:59:40,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-15 23:59:40,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-15 23:59:40,515 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-15 23:59:40,515 INFO L185 Difference]: Start difference. First operand has 152 places, 192 transitions, 2022 flow. Second operand 10 states and 1852 transitions. [2020-10-15 23:59:40,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 250 transitions, 2895 flow [2020-10-15 23:59:40,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 250 transitions, 2835 flow, removed 4 selfloop flow, removed 9 redundant places. [2020-10-15 23:59:40,607 INFO L241 Difference]: Finished difference. Result has 154 places, 192 transitions, 2074 flow [2020-10-15 23:59:40,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2074, PETRI_PLACES=154, PETRI_TRANSITIONS=192} [2020-10-15 23:59:40,608 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places. [2020-10-15 23:59:40,608 INFO L481 AbstractCegarLoop]: Abstraction has has 154 places, 192 transitions, 2074 flow [2020-10-15 23:59:40,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 23:59:40,608 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:40,608 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:40,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 23:59:40,608 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash 3003063, now seen corresponding path program 4 times [2020-10-15 23:59:40,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:40,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79240406] [2020-10-15 23:59:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:40,689 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-15 23:59:40,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79240406] [2020-10-15 23:59:40,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:40,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 23:59:40,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537781139] [2020-10-15 23:59:40,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 23:59:40,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 23:59:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 23:59:40,693 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 318 [2020-10-15 23:59:40,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 192 transitions, 2074 flow. Second operand 9 states. [2020-10-15 23:59:40,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:40,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 318 [2020-10-15 23:59:40,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:43,964 INFO L129 PetriNetUnfolder]: 17817/27930 cut-off events. [2020-10-15 23:59:43,965 INFO L130 PetriNetUnfolder]: For 111471/111541 co-relation queries the response was YES. [2020-10-15 23:59:44,157 INFO L80 FinitePrefix]: Finished finitePrefix Result has 86960 conditions, 27930 events. 17817/27930 cut-off events. For 111471/111541 co-relation queries the response was YES. Maximal size of possible extension queue 1356. Compared 204239 event pairs, 3832 based on Foata normal form. 68/20987 useless extension candidates. Maximal degree in co-relation 79576. Up to 9244 conditions per place. [2020-10-15 23:59:44,227 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 171 selfloop transitions, 67 changer transitions 0/284 dead transitions. [2020-10-15 23:59:44,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 284 transitions, 3269 flow [2020-10-15 23:59:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 23:59:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-15 23:59:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1695 transitions. [2020-10-15 23:59:44,229 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5922431865828093 [2020-10-15 23:59:44,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1695 transitions. [2020-10-15 23:59:44,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1695 transitions. [2020-10-15 23:59:44,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:44,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1695 transitions. [2020-10-15 23:59:44,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-15 23:59:44,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-15 23:59:44,232 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-15 23:59:44,232 INFO L185 Difference]: Start difference. First operand has 154 places, 192 transitions, 2074 flow. Second operand 9 states and 1695 transitions. [2020-10-15 23:59:44,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 284 transitions, 3269 flow [2020-10-15 23:59:44,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 284 transitions, 3179 flow, removed 8 selfloop flow, removed 9 redundant places. [2020-10-15 23:59:44,339 INFO L241 Difference]: Finished difference. Result has 156 places, 212 transitions, 2456 flow [2020-10-15 23:59:44,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2456, PETRI_PLACES=156, PETRI_TRANSITIONS=212} [2020-10-15 23:59:44,340 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 99 predicate places. [2020-10-15 23:59:44,340 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 212 transitions, 2456 flow [2020-10-15 23:59:44,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 23:59:44,340 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:44,340 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:44,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 23:59:44,341 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1701639209, now seen corresponding path program 5 times [2020-10-15 23:59:44,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:44,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951192433] [2020-10-15 23:59:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:44,437 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-15 23:59:44,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951192433] [2020-10-15 23:59:44,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:44,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 23:59:44,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510590875] [2020-10-15 23:59:44,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 23:59:44,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 23:59:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 23:59:44,441 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 318 [2020-10-15 23:59:44,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 212 transitions, 2456 flow. Second operand 9 states. [2020-10-15 23:59:44,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:44,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 318 [2020-10-15 23:59:44,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:47,017 INFO L129 PetriNetUnfolder]: 16992/26682 cut-off events. [2020-10-15 23:59:47,017 INFO L130 PetriNetUnfolder]: For 117412/117461 co-relation queries the response was YES. [2020-10-15 23:59:47,232 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85824 conditions, 26682 events. 16992/26682 cut-off events. For 117412/117461 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 196466 event pairs, 4508 based on Foata normal form. 68/20120 useless extension candidates. Maximal degree in co-relation 78513. Up to 18579 conditions per place. [2020-10-15 23:59:47,307 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 150 selfloop transitions, 47 changer transitions 0/243 dead transitions. [2020-10-15 23:59:47,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 243 transitions, 3062 flow [2020-10-15 23:59:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:59:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:59:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1308 transitions. [2020-10-15 23:59:47,309 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5876010781671159 [2020-10-15 23:59:47,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1308 transitions. [2020-10-15 23:59:47,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1308 transitions. [2020-10-15 23:59:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:47,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1308 transitions. [2020-10-15 23:59:47,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:59:47,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:59:47,312 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:59:47,313 INFO L185 Difference]: Start difference. First operand has 156 places, 212 transitions, 2456 flow. Second operand 7 states and 1308 transitions. [2020-10-15 23:59:47,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 243 transitions, 3062 flow [2020-10-15 23:59:47,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 243 transitions, 3033 flow, removed 12 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:47,472 INFO L241 Difference]: Finished difference. Result has 163 places, 217 transitions, 2649 flow [2020-10-15 23:59:47,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2649, PETRI_PLACES=163, PETRI_TRANSITIONS=217} [2020-10-15 23:59:47,473 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 106 predicate places. [2020-10-15 23:59:47,473 INFO L481 AbstractCegarLoop]: Abstraction has has 163 places, 217 transitions, 2649 flow [2020-10-15 23:59:47,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 23:59:47,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:47,473 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:47,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 23:59:47,473 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash -833858999, now seen corresponding path program 6 times [2020-10-15 23:59:47,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:47,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165137457] [2020-10-15 23:59:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:47,654 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-15 23:59:47,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165137457] [2020-10-15 23:59:47,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:47,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 23:59:47,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414304627] [2020-10-15 23:59:47,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 23:59:47,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 23:59:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-15 23:59:47,660 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 318 [2020-10-15 23:59:47,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 217 transitions, 2649 flow. Second operand 11 states. [2020-10-15 23:59:47,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:47,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 318 [2020-10-15 23:59:47,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:51,373 INFO L129 PetriNetUnfolder]: 18225/29027 cut-off events. [2020-10-15 23:59:51,373 INFO L130 PetriNetUnfolder]: For 122748/122748 co-relation queries the response was YES. [2020-10-15 23:59:51,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 90795 conditions, 29027 events. 18225/29027 cut-off events. For 122748/122748 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 219443 event pairs, 3633 based on Foata normal form. 147/21922 useless extension candidates. Maximal degree in co-relation 83777. Up to 17323 conditions per place. [2020-10-15 23:59:51,684 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 181 selfloop transitions, 41 changer transitions 11/279 dead transitions. [2020-10-15 23:59:51,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 279 transitions, 3689 flow [2020-10-15 23:59:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:59:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:59:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1283 transitions. [2020-10-15 23:59:51,686 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5763701707097934 [2020-10-15 23:59:51,686 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1283 transitions. [2020-10-15 23:59:51,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1283 transitions. [2020-10-15 23:59:51,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:51,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1283 transitions. [2020-10-15 23:59:51,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:59:51,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:59:51,689 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:59:51,689 INFO L185 Difference]: Start difference. First operand has 163 places, 217 transitions, 2649 flow. Second operand 7 states and 1283 transitions. [2020-10-15 23:59:51,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 279 transitions, 3689 flow [2020-10-15 23:59:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 279 transitions, 3631 flow, removed 10 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:51,841 INFO L241 Difference]: Finished difference. Result has 170 places, 222 transitions, 2775 flow [2020-10-15 23:59:51,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2775, PETRI_PLACES=170, PETRI_TRANSITIONS=222} [2020-10-15 23:59:51,842 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 113 predicate places. [2020-10-15 23:59:51,842 INFO L481 AbstractCegarLoop]: Abstraction has has 170 places, 222 transitions, 2775 flow [2020-10-15 23:59:51,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 23:59:51,842 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:51,842 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 23:59:51,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 23:59:51,843 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -861564629, now seen corresponding path program 1 times [2020-10-15 23:59:51,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:51,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494730092] [2020-10-15 23:59:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:51,881 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-15 23:59:51,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494730092] [2020-10-15 23:59:51,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:51,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 23:59:51,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657519513] [2020-10-15 23:59:51,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 23:59:51,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:51,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 23:59:51,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 23:59:51,884 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 318 [2020-10-15 23:59:51,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 222 transitions, 2775 flow. Second operand 6 states. [2020-10-15 23:59:51,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:51,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 318 [2020-10-15 23:59:51,885 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:53,393 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][164], [Black: 506#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 257#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 260#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 264#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 266#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 146#thread3EXITtrue, Black: 520#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 1)), Black: 403#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 409#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 30#L1115-1true, Black: 286#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 552#(and (or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 541#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)), 556#true, 300#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), 46#thread2EXITtrue, 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 435#(and (= |ULTIMATE.start_main_#t~mem14| 5) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 312#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), 445#true, Black: 563#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 570#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 574#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 320#(= |ULTIMATE.start_main_#t~mem14| 5), 329#true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 587#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 589#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 591#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 598#true, Black: 464#(and (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 466#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 218#(and (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), Black: 468#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 470#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 341#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 456#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 462#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 220#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), 225#true, 486#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| |thread0Thread1of1ForFork3_~#t4~0.offset|) (= thread3Thread1of1ForFork0_thidvar0 2)), Black: 608#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 614#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 616#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 228#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 362#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 628#(and (not (= |thread0Thread1of1ForFork3_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork3_~#t5~0.base|) 1)), 374#(and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), Black: 242#(= |ULTIMATE.start_main_#t~mem14| 5), 251#true]) [2020-10-15 23:59:53,394 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2020-10-15 23:59:53,394 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2020-10-15 23:59:53,394 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2020-10-15 23:59:53,394 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2020-10-15 23:59:53,564 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][181], [Black: 506#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 257#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 260#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 264#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 266#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 146#thread3EXITtrue, Black: 520#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 1)), Black: 403#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 409#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 30#L1115-1true, Black: 286#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 552#(and (or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 541#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)), 556#true, 46#thread2EXITtrue, Black: 312#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 435#(and (= |ULTIMATE.start_main_#t~mem14| 5) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 300#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), 445#true, Black: 563#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 570#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 574#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 320#(= |ULTIMATE.start_main_#t~mem14| 5), 329#true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 205#true, Black: 587#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), 84#ULTIMATE.startEXITtrue, Black: 589#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 591#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 598#true, Black: 464#(and (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 466#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 468#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 470#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 341#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 456#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), 220#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), Black: 462#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 225#true, Black: 608#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 614#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 616#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 228#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 362#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 625#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork3_~#t5~0.base| ~v~0.base))), Black: 242#(= |ULTIMATE.start_main_#t~mem14| 5), 251#true]) [2020-10-15 23:59:53,565 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2020-10-15 23:59:53,565 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2020-10-15 23:59:53,566 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2020-10-15 23:59:53,566 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2020-10-15 23:59:53,755 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 88 |v_ULTIMATE.start_main_#t~mem15_19|)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start_main_#t~mem15_19| (select (select |v_#memory_int_227| v_~v~0.base_83) v_~v~0.offset_83)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ~v~0.base=v_~v~0.base_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~v~0.offset=v_~v~0.offset_83, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ~v~0.base=v_~v~0.base_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][164], [Black: 506#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 257#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 260#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 264#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 266#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 146#thread3EXITtrue, Black: 520#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 1)), Black: 403#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 409#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 286#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 552#(and (or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 541#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)), 556#true, 300#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 435#(and (= |ULTIMATE.start_main_#t~mem14| 5) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 312#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), 445#true, Black: 563#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 570#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 574#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 320#(= |ULTIMATE.start_main_#t~mem14| 5), 329#true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 207#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 587#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 589#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 591#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 598#true, Black: 464#(and (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 466#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 218#(and (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), Black: 468#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 470#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 341#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 456#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 462#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 220#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), 225#true, 486#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| |thread0Thread1of1ForFork3_~#t4~0.offset|) (= thread3Thread1of1ForFork0_thidvar0 2)), Black: 608#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 614#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 616#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 228#(= |ULTIMATE.start_main_#t~mem14| 5), 108#L1116-1true, Black: 362#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 628#(and (not (= |thread0Thread1of1ForFork3_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork3_~#t5~0.base|) 1)), 374#(and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), Black: 242#(= |ULTIMATE.start_main_#t~mem14| 5), 251#true]) [2020-10-15 23:59:53,755 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-15 23:59:53,755 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:59:53,755 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:59:53,755 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2020-10-15 23:59:53,806 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1125-->ULTIMATE.startEXIT: Formula: (and (= 88 (select (select |#memory_int_In1528756347| ~v~0.base_In1528756347) ~v~0.offset_In1528756347)) (= |ULTIMATE.start_main_#res_Out1528756347| 0) (= ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347 |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|) (= |#valid_Out1528756347| (store |#valid_In1528756347| |ULTIMATE.start_main_~#t~0.base_In1528756347| 0)) (= |ULTIMATE.start_#t~ret16_Out1528756347| |ULTIMATE.start_main_#res_Out1528756347|) (= |ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347| 1)) InVars {~v~0.offset=~v~0.offset_In1528756347, #valid=|#valid_In1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_In1528756347|, ~v~0.base=~v~0.base_In1528756347} OutVars{ULTIMATE.start_#t~ret16=|ULTIMATE.start_#t~ret16_Out1528756347|, ULTIMATE.start___VERIFIER_assert_~expression=ULTIMATE.start___VERIFIER_assert_~expression_Out1528756347, ~v~0.offset=~v~0.offset_In1528756347, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out1528756347|, #valid=|#valid_Out1528756347|, #memory_int=|#memory_int_In1528756347|, ULTIMATE.start_main_~#t~0.base=|ULTIMATE.start_main_~#t~0.base_Out1528756347|, ULTIMATE.start_main_~#t~0.offset=|ULTIMATE.start_main_~#t~0.offset_Out1528756347|, ULTIMATE.start_main_#t~mem15=|ULTIMATE.start_main_#t~mem15_Out1528756347|, ~v~0.base=~v~0.base_In1528756347, ULTIMATE.start___VERIFIER_assert_#in~expression=|ULTIMATE.start___VERIFIER_assert_#in~expression_Out1528756347|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret16, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression][181], [Black: 506#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 257#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 260#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 264#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 266#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 146#thread3EXITtrue, Black: 520#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 1)), Black: 403#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), Black: 409#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 286#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 552#(and (or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 541#(or (= |ULTIMATE.start_main_#t~mem14| 5) (= |ULTIMATE.start_main_#t~mem14| 2)), 556#true, Black: 312#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 180#(not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0)), Black: 435#(and (= |ULTIMATE.start_main_#t~mem14| 5) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 300#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)), Black: 182#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork4_thidvar0))), 445#true, Black: 563#(= |ULTIMATE.start_main_#t~mem14| 5), Black: 570#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 574#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0))), Black: 320#(= |ULTIMATE.start_main_#t~mem14| 5), 329#true, Black: 196#(and (= |ULTIMATE.start_main_#t~mem14| 5) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |ULTIMATE.start_main_#t~mem14| thread1Thread1of1ForFork4_thidvar0))), Black: 205#true, Black: 587#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 589#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 84#ULTIMATE.startEXITtrue, Black: 591#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 598#true, Black: 464#(and (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 466#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 468#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 470#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 341#(and (= |ULTIMATE.start_main_#t~mem14| 5) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 456#(not (= |ULTIMATE.start_main_#t~mem14| thread3Thread1of1ForFork0_thidvar0)), 220#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork3_~#t3~0.base|) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| ~v~0.base))), Black: 462#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), 225#true, Black: 608#(not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)), Black: 614#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 616#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork3_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem14| thread2Thread1of1ForFork1_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |thread0Thread1of1ForFork3_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 228#(= |ULTIMATE.start_main_#t~mem14| 5), 108#L1116-1true, Black: 362#(and (not (= |thread0Thread1of1ForFork3_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 625#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork3_~#t5~0.base| ~v~0.base))), Black: 242#(= |ULTIMATE.start_main_#t~mem14| 5), 251#true]) [2020-10-15 23:59:53,807 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2020-10-15 23:59:53,807 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:59:53,807 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:59:53,807 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-15 23:59:53,896 INFO L129 PetriNetUnfolder]: 12102/21697 cut-off events. [2020-10-15 23:59:53,896 INFO L130 PetriNetUnfolder]: For 83654/84127 co-relation queries the response was YES. [2020-10-15 23:59:54,168 INFO L80 FinitePrefix]: Finished finitePrefix Result has 61133 conditions, 21697 events. 12102/21697 cut-off events. For 83654/84127 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 186569 event pairs, 729 based on Foata normal form. 243/16880 useless extension candidates. Maximal degree in co-relation 56641. Up to 6284 conditions per place. [2020-10-15 23:59:54,242 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 99 selfloop transitions, 52 changer transitions 2/260 dead transitions. [2020-10-15 23:59:54,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 260 transitions, 3427 flow [2020-10-15 23:59:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 23:59:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-15 23:59:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1539 transitions. [2020-10-15 23:59:54,244 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6913746630727763 [2020-10-15 23:59:54,244 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1539 transitions. [2020-10-15 23:59:54,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1539 transitions. [2020-10-15 23:59:54,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:54,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1539 transitions. [2020-10-15 23:59:54,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-15 23:59:54,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-15 23:59:54,248 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-15 23:59:54,248 INFO L185 Difference]: Start difference. First operand has 170 places, 222 transitions, 2775 flow. Second operand 7 states and 1539 transitions. [2020-10-15 23:59:54,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 260 transitions, 3427 flow [2020-10-15 23:59:54,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 260 transitions, 3363 flow, removed 15 selfloop flow, removed 3 redundant places. [2020-10-15 23:59:54,387 INFO L241 Difference]: Finished difference. Result has 176 places, 233 transitions, 3056 flow [2020-10-15 23:59:54,387 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3056, PETRI_PLACES=176, PETRI_TRANSITIONS=233} [2020-10-15 23:59:54,387 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 119 predicate places. [2020-10-15 23:59:54,387 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 233 transitions, 3056 flow [2020-10-15 23:59:54,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 23:59:54,388 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:54,388 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-15 23:59:54,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 23:59:54,388 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash 90100900, now seen corresponding path program 1 times [2020-10-15 23:59:54,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:54,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929525675] [2020-10-15 23:59:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:54,498 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-15 23:59:54,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929525675] [2020-10-15 23:59:54,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:54,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 23:59:54,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698354240] [2020-10-15 23:59:54,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 23:59:54,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 23:59:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-15 23:59:54,502 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 318 [2020-10-15 23:59:54,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 233 transitions, 3056 flow. Second operand 10 states. [2020-10-15 23:59:54,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:54,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 318 [2020-10-15 23:59:54,503 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-15 23:59:58,017 INFO L129 PetriNetUnfolder]: 19013/30308 cut-off events. [2020-10-15 23:59:58,017 INFO L130 PetriNetUnfolder]: For 180278/180414 co-relation queries the response was YES. [2020-10-15 23:59:58,302 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104084 conditions, 30308 events. 19013/30308 cut-off events. For 180278/180414 co-relation queries the response was YES. Maximal size of possible extension queue 1534. Compared 231481 event pairs, 4096 based on Foata normal form. 194/23007 useless extension candidates. Maximal degree in co-relation 95964. Up to 10598 conditions per place. [2020-10-15 23:59:58,385 INFO L132 encePairwiseOnDemand]: 310/318 looper letters, 186 selfloop transitions, 52 changer transitions 0/284 dead transitions. [2020-10-15 23:59:58,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 284 transitions, 4064 flow [2020-10-15 23:59:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 23:59:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-15 23:59:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1459 transitions. [2020-10-15 23:59:58,387 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5735062893081762 [2020-10-15 23:59:58,387 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1459 transitions. [2020-10-15 23:59:58,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1459 transitions. [2020-10-15 23:59:58,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-15 23:59:58,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1459 transitions. [2020-10-15 23:59:58,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-15 23:59:58,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-15 23:59:58,391 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-15 23:59:58,391 INFO L185 Difference]: Start difference. First operand has 176 places, 233 transitions, 3056 flow. Second operand 8 states and 1459 transitions. [2020-10-15 23:59:58,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 284 transitions, 4064 flow [2020-10-15 23:59:58,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 284 transitions, 4033 flow, removed 10 selfloop flow, removed 2 redundant places. [2020-10-15 23:59:58,850 INFO L241 Difference]: Finished difference. Result has 183 places, 232 transitions, 3160 flow [2020-10-15 23:59:58,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2993, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3160, PETRI_PLACES=183, PETRI_TRANSITIONS=232} [2020-10-15 23:59:58,850 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 126 predicate places. [2020-10-15 23:59:58,851 INFO L481 AbstractCegarLoop]: Abstraction has has 183 places, 232 transitions, 3160 flow [2020-10-15 23:59:58,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 23:59:58,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-15 23:59:58,851 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-15 23:59:58,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 23:59:58,851 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 23:59:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 23:59:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2100223358, now seen corresponding path program 2 times [2020-10-15 23:59:58,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 23:59:58,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426789968] [2020-10-15 23:59:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 23:59:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 23:59:58,975 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-15 23:59:58,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426789968] [2020-10-15 23:59:58,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 23:59:58,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 23:59:58,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828500804] [2020-10-15 23:59:58,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 23:59:58,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 23:59:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 23:59:58,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-15 23:59:58,979 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 318 [2020-10-15 23:59:58,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 232 transitions, 3160 flow. Second operand 11 states. [2020-10-15 23:59:58,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-15 23:59:58,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 318 [2020-10-15 23:59:58,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:02,909 INFO L129 PetriNetUnfolder]: 19273/30748 cut-off events. [2020-10-16 00:00:02,909 INFO L130 PetriNetUnfolder]: For 188274/188276 co-relation queries the response was YES. [2020-10-16 00:00:03,179 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106234 conditions, 30748 events. 19273/30748 cut-off events. For 188274/188276 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 235194 event pairs, 4021 based on Foata normal form. 128/23263 useless extension candidates. Maximal degree in co-relation 97621. Up to 12559 conditions per place. [2020-10-16 00:00:03,239 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 176 selfloop transitions, 79 changer transitions 17/318 dead transitions. [2020-10-16 00:00:03,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 318 transitions, 4469 flow [2020-10-16 00:00:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 00:00:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 00:00:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1997 transitions. [2020-10-16 00:00:03,241 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5708976558033162 [2020-10-16 00:00:03,242 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1997 transitions. [2020-10-16 00:00:03,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1997 transitions. [2020-10-16 00:00:03,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:03,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1997 transitions. [2020-10-16 00:00:03,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 00:00:03,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 00:00:03,247 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 00:00:03,247 INFO L185 Difference]: Start difference. First operand has 183 places, 232 transitions, 3160 flow. Second operand 11 states and 1997 transitions. [2020-10-16 00:00:03,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 318 transitions, 4469 flow [2020-10-16 00:00:03,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 318 transitions, 4310 flow, removed 17 selfloop flow, removed 8 redundant places. [2020-10-16 00:00:03,560 INFO L241 Difference]: Finished difference. Result has 189 places, 224 transitions, 3152 flow [2020-10-16 00:00:03,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2919, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3152, PETRI_PLACES=189, PETRI_TRANSITIONS=224} [2020-10-16 00:00:03,560 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 132 predicate places. [2020-10-16 00:00:03,560 INFO L481 AbstractCegarLoop]: Abstraction has has 189 places, 224 transitions, 3152 flow [2020-10-16 00:00:03,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 00:00:03,561 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:03,561 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 00:00:03,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 00:00:03,561 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -70918942, now seen corresponding path program 1 times [2020-10-16 00:00:03,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:03,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080521149] [2020-10-16 00:00:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:03,728 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 00:00:03,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080521149] [2020-10-16 00:00:03,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:03,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 00:00:03,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190361489] [2020-10-16 00:00:03,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 00:00:03,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 00:00:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-16 00:00:03,732 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 318 [2020-10-16 00:00:03,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 224 transitions, 3152 flow. Second operand 12 states. [2020-10-16 00:00:03,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:03,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 318 [2020-10-16 00:00:03,733 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:06,925 INFO L129 PetriNetUnfolder]: 17342/27793 cut-off events. [2020-10-16 00:00:06,926 INFO L130 PetriNetUnfolder]: For 177792/177900 co-relation queries the response was YES. [2020-10-16 00:00:07,391 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94814 conditions, 27793 events. 17342/27793 cut-off events. For 177792/177900 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 210229 event pairs, 3047 based on Foata normal form. 109/20971 useless extension candidates. Maximal degree in co-relation 90133. Up to 14294 conditions per place. [2020-10-16 00:00:07,489 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 153 selfloop transitions, 61 changer transitions 21/281 dead transitions. [2020-10-16 00:00:07,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 281 transitions, 4115 flow [2020-10-16 00:00:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 00:00:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 00:00:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1958 transitions. [2020-10-16 00:00:07,495 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.559748427672956 [2020-10-16 00:00:07,495 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1958 transitions. [2020-10-16 00:00:07,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1958 transitions. [2020-10-16 00:00:07,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:07,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1958 transitions. [2020-10-16 00:00:07,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 00:00:07,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 00:00:07,503 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 00:00:07,503 INFO L185 Difference]: Start difference. First operand has 189 places, 224 transitions, 3152 flow. Second operand 11 states and 1958 transitions. [2020-10-16 00:00:07,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 281 transitions, 4115 flow [2020-10-16 00:00:07,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 281 transitions, 3956 flow, removed 5 selfloop flow, removed 11 redundant places. [2020-10-16 00:00:07,808 INFO L241 Difference]: Finished difference. Result has 188 places, 214 transitions, 2979 flow [2020-10-16 00:00:07,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2933, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2979, PETRI_PLACES=188, PETRI_TRANSITIONS=214} [2020-10-16 00:00:07,808 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 131 predicate places. [2020-10-16 00:00:07,808 INFO L481 AbstractCegarLoop]: Abstraction has has 188 places, 214 transitions, 2979 flow [2020-10-16 00:00:07,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 00:00:07,808 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:07,809 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:07,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 00:00:07,809 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1668681077, now seen corresponding path program 1 times [2020-10-16 00:00:07,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:07,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395886465] [2020-10-16 00:00:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:07,839 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 00:00:07,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395886465] [2020-10-16 00:00:07,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:07,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 00:00:07,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750270003] [2020-10-16 00:00:07,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 00:00:07,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 00:00:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 00:00:07,842 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 318 [2020-10-16 00:00:07,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 214 transitions, 2979 flow. Second operand 5 states. [2020-10-16 00:00:07,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:07,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 318 [2020-10-16 00:00:07,843 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:10,571 INFO L129 PetriNetUnfolder]: 14743/24330 cut-off events. [2020-10-16 00:00:10,571 INFO L130 PetriNetUnfolder]: For 159340/159436 co-relation queries the response was YES. [2020-10-16 00:00:10,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83279 conditions, 24330 events. 14743/24330 cut-off events. For 159340/159436 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 190665 event pairs, 3617 based on Foata normal form. 96/18427 useless extension candidates. Maximal degree in co-relation 77782. Up to 15570 conditions per place. [2020-10-16 00:00:10,808 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 194 selfloop transitions, 6 changer transitions 3/267 dead transitions. [2020-10-16 00:00:10,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 267 transitions, 4024 flow [2020-10-16 00:00:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 00:00:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 00:00:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2020-10-16 00:00:10,810 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7085953878406709 [2020-10-16 00:00:10,810 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1352 transitions. [2020-10-16 00:00:10,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1352 transitions. [2020-10-16 00:00:10,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:10,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1352 transitions. [2020-10-16 00:00:10,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 00:00:10,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 00:00:10,813 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 00:00:10,813 INFO L185 Difference]: Start difference. First operand has 188 places, 214 transitions, 2979 flow. Second operand 6 states and 1352 transitions. [2020-10-16 00:00:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 267 transitions, 4024 flow [2020-10-16 00:00:11,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 267 transitions, 3856 flow, removed 19 selfloop flow, removed 9 redundant places. [2020-10-16 00:00:11,007 INFO L241 Difference]: Finished difference. Result has 186 places, 215 transitions, 2852 flow [2020-10-16 00:00:11,007 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2852, PETRI_PLACES=186, PETRI_TRANSITIONS=215} [2020-10-16 00:00:11,007 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 129 predicate places. [2020-10-16 00:00:11,008 INFO L481 AbstractCegarLoop]: Abstraction has has 186 places, 215 transitions, 2852 flow [2020-10-16 00:00:11,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 00:00:11,008 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:11,008 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:11,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 00:00:11,008 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 425494239, now seen corresponding path program 2 times [2020-10-16 00:00:11,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:11,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044890487] [2020-10-16 00:00:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:11,051 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 00:00:11,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044890487] [2020-10-16 00:00:11,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:11,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 00:00:11,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605178022] [2020-10-16 00:00:11,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 00:00:11,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 00:00:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 00:00:11,054 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 318 [2020-10-16 00:00:11,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 215 transitions, 2852 flow. Second operand 6 states. [2020-10-16 00:00:11,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:11,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 318 [2020-10-16 00:00:11,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:13,422 INFO L129 PetriNetUnfolder]: 14068/23467 cut-off events. [2020-10-16 00:00:13,423 INFO L130 PetriNetUnfolder]: For 137174/137238 co-relation queries the response was YES. [2020-10-16 00:00:13,648 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79793 conditions, 23467 events. 14068/23467 cut-off events. For 137174/137238 co-relation queries the response was YES. Maximal size of possible extension queue 1246. Compared 185269 event pairs, 3294 based on Foata normal form. 192/17955 useless extension candidates. Maximal degree in co-relation 75050. Up to 12984 conditions per place. [2020-10-16 00:00:13,695 INFO L132 encePairwiseOnDemand]: 311/318 looper letters, 194 selfloop transitions, 13 changer transitions 3/268 dead transitions. [2020-10-16 00:00:13,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 268 transitions, 3893 flow [2020-10-16 00:00:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 00:00:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 00:00:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1146 transitions. [2020-10-16 00:00:13,698 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.60062893081761 [2020-10-16 00:00:13,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1146 transitions. [2020-10-16 00:00:13,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1146 transitions. [2020-10-16 00:00:13,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:13,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1146 transitions. [2020-10-16 00:00:13,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 00:00:13,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 00:00:13,700 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 00:00:13,700 INFO L185 Difference]: Start difference. First operand has 186 places, 215 transitions, 2852 flow. Second operand 6 states and 1146 transitions. [2020-10-16 00:00:13,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 268 transitions, 3893 flow [2020-10-16 00:00:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 268 transitions, 3882 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 00:00:13,956 INFO L241 Difference]: Finished difference. Result has 189 places, 216 transitions, 2887 flow [2020-10-16 00:00:13,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2887, PETRI_PLACES=189, PETRI_TRANSITIONS=216} [2020-10-16 00:00:13,957 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 132 predicate places. [2020-10-16 00:00:13,957 INFO L481 AbstractCegarLoop]: Abstraction has has 189 places, 216 transitions, 2887 flow [2020-10-16 00:00:13,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 00:00:13,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:13,957 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:13,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 00:00:13,958 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1970094108, now seen corresponding path program 1 times [2020-10-16 00:00:13,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:13,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931325491] [2020-10-16 00:00:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:14,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 00:00:14,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931325491] [2020-10-16 00:00:14,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:14,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 00:00:14,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343284541] [2020-10-16 00:00:14,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 00:00:14,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 00:00:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 00:00:14,067 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 318 [2020-10-16 00:00:14,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 216 transitions, 2887 flow. Second operand 10 states. [2020-10-16 00:00:14,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:14,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 318 [2020-10-16 00:00:14,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:17,105 INFO L129 PetriNetUnfolder]: 14394/24112 cut-off events. [2020-10-16 00:00:17,106 INFO L130 PetriNetUnfolder]: For 137040/137160 co-relation queries the response was YES. [2020-10-16 00:00:17,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83129 conditions, 24112 events. 14394/24112 cut-off events. For 137040/137160 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 192643 event pairs, 3188 based on Foata normal form. 61/18270 useless extension candidates. Maximal degree in co-relation 78383. Up to 15397 conditions per place. [2020-10-16 00:00:17,322 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 159 selfloop transitions, 40 changer transitions 0/256 dead transitions. [2020-10-16 00:00:17,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 256 transitions, 3662 flow [2020-10-16 00:00:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:00:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:00:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2020-10-16 00:00:17,329 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5808625336927223 [2020-10-16 00:00:17,329 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1293 transitions. [2020-10-16 00:00:17,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1293 transitions. [2020-10-16 00:00:17,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:17,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1293 transitions. [2020-10-16 00:00:17,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:00:17,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:00:17,332 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:00:17,333 INFO L185 Difference]: Start difference. First operand has 189 places, 216 transitions, 2887 flow. Second operand 7 states and 1293 transitions. [2020-10-16 00:00:17,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 256 transitions, 3662 flow [2020-10-16 00:00:17,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 256 transitions, 3633 flow, removed 2 selfloop flow, removed 5 redundant places. [2020-10-16 00:00:17,599 INFO L241 Difference]: Finished difference. Result has 194 places, 234 transitions, 3288 flow [2020-10-16 00:00:17,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3288, PETRI_PLACES=194, PETRI_TRANSITIONS=234} [2020-10-16 00:00:17,599 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 137 predicate places. [2020-10-16 00:00:17,599 INFO L481 AbstractCegarLoop]: Abstraction has has 194 places, 234 transitions, 3288 flow [2020-10-16 00:00:17,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 00:00:17,600 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:17,600 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:17,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 00:00:17,600 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:17,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1986737469, now seen corresponding path program 3 times [2020-10-16 00:00:17,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:17,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070211136] [2020-10-16 00:00:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:17,691 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 00:00:17,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070211136] [2020-10-16 00:00:17,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:17,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 00:00:17,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311070962] [2020-10-16 00:00:17,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 00:00:17,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 00:00:17,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 00:00:17,695 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 318 [2020-10-16 00:00:17,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 234 transitions, 3288 flow. Second operand 10 states. [2020-10-16 00:00:17,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:17,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 318 [2020-10-16 00:00:17,696 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:20,365 INFO L129 PetriNetUnfolder]: 13264/22870 cut-off events. [2020-10-16 00:00:20,365 INFO L130 PetriNetUnfolder]: For 142334/142432 co-relation queries the response was YES. [2020-10-16 00:00:20,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 78885 conditions, 22870 events. 13264/22870 cut-off events. For 142334/142432 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 186873 event pairs, 2596 based on Foata normal form. 511/17997 useless extension candidates. Maximal degree in co-relation 73909. Up to 6873 conditions per place. [2020-10-16 00:00:20,638 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 177 selfloop transitions, 69 changer transitions 7/310 dead transitions. [2020-10-16 00:00:20,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 310 transitions, 4498 flow [2020-10-16 00:00:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:00:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:00:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1673 transitions. [2020-10-16 00:00:20,641 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5845562543675751 [2020-10-16 00:00:20,641 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1673 transitions. [2020-10-16 00:00:20,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1673 transitions. [2020-10-16 00:00:20,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:20,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1673 transitions. [2020-10-16 00:00:20,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:00:20,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:00:20,643 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:00:20,643 INFO L185 Difference]: Start difference. First operand has 194 places, 234 transitions, 3288 flow. Second operand 9 states and 1673 transitions. [2020-10-16 00:00:20,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 310 transitions, 4498 flow [2020-10-16 00:00:20,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 310 transitions, 4373 flow, removed 61 selfloop flow, removed 1 redundant places. [2020-10-16 00:00:20,983 INFO L241 Difference]: Finished difference. Result has 205 places, 238 transitions, 3493 flow [2020-10-16 00:00:20,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=3107, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3493, PETRI_PLACES=205, PETRI_TRANSITIONS=238} [2020-10-16 00:00:20,984 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 148 predicate places. [2020-10-16 00:00:20,984 INFO L481 AbstractCegarLoop]: Abstraction has has 205 places, 238 transitions, 3493 flow [2020-10-16 00:00:20,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 00:00:20,984 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:20,984 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:20,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 00:00:20,985 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1050445938, now seen corresponding path program 2 times [2020-10-16 00:00:20,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:20,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250845618] [2020-10-16 00:00:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:21,187 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 00:00:21,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250845618] [2020-10-16 00:00:21,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:21,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 00:00:21,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830850810] [2020-10-16 00:00:21,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 00:00:21,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 00:00:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-16 00:00:21,190 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 318 [2020-10-16 00:00:21,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 238 transitions, 3493 flow. Second operand 13 states. [2020-10-16 00:00:21,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:21,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 318 [2020-10-16 00:00:21,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:24,816 INFO L129 PetriNetUnfolder]: 17013/29434 cut-off events. [2020-10-16 00:00:24,817 INFO L130 PetriNetUnfolder]: For 173227/173335 co-relation queries the response was YES. [2020-10-16 00:00:25,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98769 conditions, 29434 events. 17013/29434 cut-off events. For 173227/173335 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 252484 event pairs, 3540 based on Foata normal form. 60/22309 useless extension candidates. Maximal degree in co-relation 92445. Up to 12562 conditions per place. [2020-10-16 00:00:25,214 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 193 selfloop transitions, 49 changer transitions 0/299 dead transitions. [2020-10-16 00:00:25,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 299 transitions, 4521 flow [2020-10-16 00:00:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 00:00:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 00:00:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1464 transitions. [2020-10-16 00:00:25,216 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2020-10-16 00:00:25,217 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1464 transitions. [2020-10-16 00:00:25,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1464 transitions. [2020-10-16 00:00:25,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:25,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1464 transitions. [2020-10-16 00:00:25,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 00:00:25,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 00:00:25,220 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 00:00:25,220 INFO L185 Difference]: Start difference. First operand has 205 places, 238 transitions, 3493 flow. Second operand 8 states and 1464 transitions. [2020-10-16 00:00:25,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 299 transitions, 4521 flow [2020-10-16 00:00:25,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 299 transitions, 4463 flow, removed 9 selfloop flow, removed 3 redundant places. [2020-10-16 00:00:25,778 INFO L241 Difference]: Finished difference. Result has 211 places, 241 transitions, 3620 flow [2020-10-16 00:00:25,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=3447, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3620, PETRI_PLACES=211, PETRI_TRANSITIONS=241} [2020-10-16 00:00:25,779 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 154 predicate places. [2020-10-16 00:00:25,779 INFO L481 AbstractCegarLoop]: Abstraction has has 211 places, 241 transitions, 3620 flow [2020-10-16 00:00:25,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 00:00:25,779 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:25,779 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:25,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-16 00:00:25,780 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2112620441, now seen corresponding path program 1 times [2020-10-16 00:00:25,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:25,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408516869] [2020-10-16 00:00:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:25,906 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 00:00:25,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408516869] [2020-10-16 00:00:25,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:25,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 00:00:25,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980720784] [2020-10-16 00:00:25,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 00:00:25,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 00:00:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 00:00:25,910 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 318 [2020-10-16 00:00:25,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 241 transitions, 3620 flow. Second operand 10 states. [2020-10-16 00:00:25,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:25,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 318 [2020-10-16 00:00:25,912 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:29,379 INFO L129 PetriNetUnfolder]: 17495/30387 cut-off events. [2020-10-16 00:00:29,379 INFO L130 PetriNetUnfolder]: For 186997/187113 co-relation queries the response was YES. [2020-10-16 00:00:29,731 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102856 conditions, 30387 events. 17495/30387 cut-off events. For 186997/187113 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 263326 event pairs, 3875 based on Foata normal form. 74/22994 useless extension candidates. Maximal degree in co-relation 96492. Up to 10285 conditions per place. [2020-10-16 00:00:29,796 INFO L132 encePairwiseOnDemand]: 307/318 looper letters, 197 selfloop transitions, 51 changer transitions 2/307 dead transitions. [2020-10-16 00:00:29,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 307 transitions, 4928 flow [2020-10-16 00:00:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 00:00:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 00:00:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2154 transitions. [2020-10-16 00:00:29,799 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5644654088050315 [2020-10-16 00:00:29,799 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2154 transitions. [2020-10-16 00:00:29,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2154 transitions. [2020-10-16 00:00:29,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:29,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2154 transitions. [2020-10-16 00:00:29,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 00:00:29,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 00:00:29,804 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 00:00:29,804 INFO L185 Difference]: Start difference. First operand has 211 places, 241 transitions, 3620 flow. Second operand 12 states and 2154 transitions. [2020-10-16 00:00:29,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 307 transitions, 4928 flow [2020-10-16 00:00:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 307 transitions, 4822 flow, removed 6 selfloop flow, removed 5 redundant places. [2020-10-16 00:00:30,353 INFO L241 Difference]: Finished difference. Result has 220 places, 250 transitions, 3809 flow [2020-10-16 00:00:30,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=3529, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3809, PETRI_PLACES=220, PETRI_TRANSITIONS=250} [2020-10-16 00:00:30,353 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 163 predicate places. [2020-10-16 00:00:30,353 INFO L481 AbstractCegarLoop]: Abstraction has has 220 places, 250 transitions, 3809 flow [2020-10-16 00:00:30,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 00:00:30,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:30,354 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:30,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-16 00:00:30,354 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -353295757, now seen corresponding path program 2 times [2020-10-16 00:00:30,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:30,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491298261] [2020-10-16 00:00:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:30,493 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 00:00:30,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491298261] [2020-10-16 00:00:30,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:30,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 00:00:30,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746249724] [2020-10-16 00:00:30,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 00:00:30,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 00:00:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-16 00:00:30,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 318 [2020-10-16 00:00:30,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 250 transitions, 3809 flow. Second operand 11 states. [2020-10-16 00:00:30,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:30,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 318 [2020-10-16 00:00:30,499 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:34,881 INFO L129 PetriNetUnfolder]: 17357/30478 cut-off events. [2020-10-16 00:00:34,881 INFO L130 PetriNetUnfolder]: For 185616/185724 co-relation queries the response was YES. [2020-10-16 00:00:35,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101457 conditions, 30478 events. 17357/30478 cut-off events. For 185616/185724 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 267457 event pairs, 3576 based on Foata normal form. 255/23337 useless extension candidates. Maximal degree in co-relation 99329. Up to 11436 conditions per place. [2020-10-16 00:00:35,199 INFO L132 encePairwiseOnDemand]: 305/318 looper letters, 155 selfloop transitions, 89 changer transitions 11/312 dead transitions. [2020-10-16 00:00:35,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 312 transitions, 5054 flow [2020-10-16 00:00:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 00:00:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 00:00:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2148 transitions. [2020-10-16 00:00:35,202 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5628930817610063 [2020-10-16 00:00:35,202 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2148 transitions. [2020-10-16 00:00:35,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2148 transitions. [2020-10-16 00:00:35,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:35,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2148 transitions. [2020-10-16 00:00:35,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 00:00:35,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 00:00:35,206 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 00:00:35,206 INFO L185 Difference]: Start difference. First operand has 220 places, 250 transitions, 3809 flow. Second operand 12 states and 2148 transitions. [2020-10-16 00:00:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 312 transitions, 5054 flow [2020-10-16 00:00:35,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 312 transitions, 5014 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-16 00:00:35,575 INFO L241 Difference]: Finished difference. Result has 230 places, 257 transitions, 4202 flow [2020-10-16 00:00:35,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4202, PETRI_PLACES=230, PETRI_TRANSITIONS=257} [2020-10-16 00:00:35,575 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 173 predicate places. [2020-10-16 00:00:35,575 INFO L481 AbstractCegarLoop]: Abstraction has has 230 places, 257 transitions, 4202 flow [2020-10-16 00:00:35,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 00:00:35,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:35,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:35,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-16 00:00:35,576 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:35,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash -956866983, now seen corresponding path program 3 times [2020-10-16 00:00:35,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:35,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394623356] [2020-10-16 00:00:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:35,762 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 00:00:35,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394623356] [2020-10-16 00:00:35,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:35,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 00:00:35,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199402252] [2020-10-16 00:00:35,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 00:00:35,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 00:00:35,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-16 00:00:35,766 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 318 [2020-10-16 00:00:35,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 257 transitions, 4202 flow. Second operand 12 states. [2020-10-16 00:00:35,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:35,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 318 [2020-10-16 00:00:35,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:39,655 INFO L129 PetriNetUnfolder]: 17251/30537 cut-off events. [2020-10-16 00:00:39,656 INFO L130 PetriNetUnfolder]: For 211782/211859 co-relation queries the response was YES. [2020-10-16 00:00:40,034 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104169 conditions, 30537 events. 17251/30537 cut-off events. For 211782/211859 co-relation queries the response was YES. Maximal size of possible extension queue 1706. Compared 271670 event pairs, 2545 based on Foata normal form. 224/23565 useless extension candidates. Maximal degree in co-relation 101995. Up to 13615 conditions per place. [2020-10-16 00:00:40,089 INFO L132 encePairwiseOnDemand]: 308/318 looper letters, 169 selfloop transitions, 89 changer transitions 3/318 dead transitions. [2020-10-16 00:00:40,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 318 transitions, 5176 flow [2020-10-16 00:00:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 00:00:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 00:00:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2134 transitions. [2020-10-16 00:00:40,092 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5592243186582809 [2020-10-16 00:00:40,092 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2134 transitions. [2020-10-16 00:00:40,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2134 transitions. [2020-10-16 00:00:40,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:40,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2134 transitions. [2020-10-16 00:00:40,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 00:00:40,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 00:00:40,097 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 00:00:40,097 INFO L185 Difference]: Start difference. First operand has 230 places, 257 transitions, 4202 flow. Second operand 12 states and 2134 transitions. [2020-10-16 00:00:40,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 318 transitions, 5176 flow [2020-10-16 00:00:40,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 318 transitions, 5059 flow, removed 18 selfloop flow, removed 8 redundant places. [2020-10-16 00:00:40,681 INFO L241 Difference]: Finished difference. Result has 235 places, 258 transitions, 4323 flow [2020-10-16 00:00:40,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=4031, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4323, PETRI_PLACES=235, PETRI_TRANSITIONS=258} [2020-10-16 00:00:40,682 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 178 predicate places. [2020-10-16 00:00:40,682 INFO L481 AbstractCegarLoop]: Abstraction has has 235 places, 258 transitions, 4323 flow [2020-10-16 00:00:40,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 00:00:40,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:40,682 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:40,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-16 00:00:40,682 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -20568725, now seen corresponding path program 4 times [2020-10-16 00:00:40,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:40,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740032856] [2020-10-16 00:00:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:41,014 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 00:00:41,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740032856] [2020-10-16 00:00:41,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:41,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 00:00:41,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724931471] [2020-10-16 00:00:41,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 00:00:41,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 00:00:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-16 00:00:41,018 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 318 [2020-10-16 00:00:41,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 258 transitions, 4323 flow. Second operand 13 states. [2020-10-16 00:00:41,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:41,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 318 [2020-10-16 00:00:41,019 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:46,985 INFO L129 PetriNetUnfolder]: 23423/41607 cut-off events. [2020-10-16 00:00:46,985 INFO L130 PetriNetUnfolder]: For 283732/283797 co-relation queries the response was YES. [2020-10-16 00:00:47,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 139855 conditions, 41607 events. 23423/41607 cut-off events. For 283732/283797 co-relation queries the response was YES. Maximal size of possible extension queue 2430. Compared 387801 event pairs, 2358 based on Foata normal form. 102/32143 useless extension candidates. Maximal degree in co-relation 137682. Up to 16208 conditions per place. [2020-10-16 00:00:47,550 INFO L132 encePairwiseOnDemand]: 303/318 looper letters, 219 selfloop transitions, 89 changer transitions 9/374 dead transitions. [2020-10-16 00:00:47,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 374 transitions, 6327 flow [2020-10-16 00:00:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 00:00:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 00:00:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2343 transitions. [2020-10-16 00:00:47,555 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5667634252539913 [2020-10-16 00:00:47,555 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2343 transitions. [2020-10-16 00:00:47,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2343 transitions. [2020-10-16 00:00:47,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:47,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2343 transitions. [2020-10-16 00:00:47,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 00:00:47,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 00:00:47,559 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 00:00:47,559 INFO L185 Difference]: Start difference. First operand has 235 places, 258 transitions, 4323 flow. Second operand 13 states and 2343 transitions. [2020-10-16 00:00:47,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 374 transitions, 6327 flow [2020-10-16 00:00:48,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 374 transitions, 6237 flow, removed 15 selfloop flow, removed 6 redundant places. [2020-10-16 00:00:48,205 INFO L241 Difference]: Finished difference. Result has 247 places, 286 transitions, 5045 flow [2020-10-16 00:00:48,206 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=4262, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5045, PETRI_PLACES=247, PETRI_TRANSITIONS=286} [2020-10-16 00:00:48,206 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 190 predicate places. [2020-10-16 00:00:48,206 INFO L481 AbstractCegarLoop]: Abstraction has has 247 places, 286 transitions, 5045 flow [2020-10-16 00:00:48,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 00:00:48,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:48,206 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:48,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-16 00:00:48,206 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash -940216895, now seen corresponding path program 5 times [2020-10-16 00:00:48,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:48,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251446049] [2020-10-16 00:00:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:48,432 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 00:00:48,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251446049] [2020-10-16 00:00:48,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:48,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 00:00:48,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819078204] [2020-10-16 00:00:48,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 00:00:48,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 00:00:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-16 00:00:48,436 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 318 [2020-10-16 00:00:48,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 286 transitions, 5045 flow. Second operand 12 states. [2020-10-16 00:00:48,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:48,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 318 [2020-10-16 00:00:48,438 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:00:54,122 INFO L129 PetriNetUnfolder]: 21860/39176 cut-off events. [2020-10-16 00:00:54,122 INFO L130 PetriNetUnfolder]: For 348706/348783 co-relation queries the response was YES. [2020-10-16 00:00:54,601 INFO L80 FinitePrefix]: Finished finitePrefix Result has 144782 conditions, 39176 events. 21860/39176 cut-off events. For 348706/348783 co-relation queries the response was YES. Maximal size of possible extension queue 2331. Compared 365549 event pairs, 3132 based on Foata normal form. 146/29811 useless extension candidates. Maximal degree in co-relation 144573. Up to 18956 conditions per place. [2020-10-16 00:00:54,662 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 203 selfloop transitions, 55 changer transitions 3/318 dead transitions. [2020-10-16 00:00:54,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 318 transitions, 5943 flow [2020-10-16 00:00:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:00:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:00:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1590 transitions. [2020-10-16 00:00:54,666 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2020-10-16 00:00:54,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1590 transitions. [2020-10-16 00:00:54,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1590 transitions. [2020-10-16 00:00:54,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:00:54,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1590 transitions. [2020-10-16 00:00:54,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:00:54,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:00:54,670 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:00:54,670 INFO L185 Difference]: Start difference. First operand has 247 places, 286 transitions, 5045 flow. Second operand 9 states and 1590 transitions. [2020-10-16 00:00:54,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 318 transitions, 5943 flow [2020-10-16 00:00:55,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 318 transitions, 5574 flow, removed 74 selfloop flow, removed 9 redundant places. [2020-10-16 00:00:55,466 INFO L241 Difference]: Finished difference. Result has 244 places, 276 transitions, 4783 flow [2020-10-16 00:00:55,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=4588, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4783, PETRI_PLACES=244, PETRI_TRANSITIONS=276} [2020-10-16 00:00:55,467 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 187 predicate places. [2020-10-16 00:00:55,467 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 276 transitions, 4783 flow [2020-10-16 00:00:55,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 00:00:55,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:00:55,467 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:00:55,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-16 00:00:55,468 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:00:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:00:55,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1420150412, now seen corresponding path program 1 times [2020-10-16 00:00:55,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:00:55,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632507740] [2020-10-16 00:00:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:00:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:00:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:00:55,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632507740] [2020-10-16 00:00:55,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:00:55,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 00:00:55,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014352440] [2020-10-16 00:00:55,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:00:55,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:00:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:00:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:00:55,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 318 [2020-10-16 00:00:55,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 276 transitions, 4783 flow. Second operand 9 states. [2020-10-16 00:00:55,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:00:55,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 318 [2020-10-16 00:00:55,563 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:01,676 INFO L129 PetriNetUnfolder]: 22386/39951 cut-off events. [2020-10-16 00:01:01,677 INFO L130 PetriNetUnfolder]: For 281220/281522 co-relation queries the response was YES. [2020-10-16 00:01:02,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 150884 conditions, 39951 events. 22386/39951 cut-off events. For 281220/281522 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 371050 event pairs, 3861 based on Foata normal form. 745/31401 useless extension candidates. Maximal degree in co-relation 150679. Up to 19350 conditions per place. [2020-10-16 00:01:02,216 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 156 selfloop transitions, 38 changer transitions 11/298 dead transitions. [2020-10-16 00:01:02,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 298 transitions, 5550 flow [2020-10-16 00:01:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2020-10-16 00:01:02,222 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2020-10-16 00:01:02,222 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2020-10-16 00:01:02,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2020-10-16 00:01:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:02,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2020-10-16 00:01:02,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:02,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:02,236 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:02,237 INFO L185 Difference]: Start difference. First operand has 244 places, 276 transitions, 4783 flow. Second operand 7 states and 1498 transitions. [2020-10-16 00:01:02,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 298 transitions, 5550 flow [2020-10-16 00:01:02,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 298 transitions, 5486 flow, removed 0 selfloop flow, removed 6 redundant places. [2020-10-16 00:01:02,804 INFO L241 Difference]: Finished difference. Result has 244 places, 274 transitions, 4789 flow [2020-10-16 00:01:02,804 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=4713, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4789, PETRI_PLACES=244, PETRI_TRANSITIONS=274} [2020-10-16 00:01:02,804 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 187 predicate places. [2020-10-16 00:01:02,804 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 274 transitions, 4789 flow [2020-10-16 00:01:02,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:02,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:02,805 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:02,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-16 00:01:02,805 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:01:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 199446881, now seen corresponding path program 1 times [2020-10-16 00:01:02,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:02,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544925950] [2020-10-16 00:01:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:02,881 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 00:01:02,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544925950] [2020-10-16 00:01:02,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:02,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:02,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320325413] [2020-10-16 00:01:02,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 00:01:02,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 00:01:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 00:01:02,885 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 318 [2020-10-16 00:01:02,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 274 transitions, 4789 flow. Second operand 8 states. [2020-10-16 00:01:02,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:02,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 318 [2020-10-16 00:01:02,886 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:07,755 INFO L129 PetriNetUnfolder]: 20875/38321 cut-off events. [2020-10-16 00:01:07,756 INFO L130 PetriNetUnfolder]: For 249816/250195 co-relation queries the response was YES. [2020-10-16 00:01:08,279 INFO L80 FinitePrefix]: Finished finitePrefix Result has 141247 conditions, 38321 events. 20875/38321 cut-off events. For 249816/250195 co-relation queries the response was YES. Maximal size of possible extension queue 2355. Compared 366863 event pairs, 3973 based on Foata normal form. 138/29350 useless extension candidates. Maximal degree in co-relation 141052. Up to 20753 conditions per place. [2020-10-16 00:01:08,340 INFO L132 encePairwiseOnDemand]: 309/318 looper letters, 143 selfloop transitions, 44 changer transitions 15/295 dead transitions. [2020-10-16 00:01:08,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 295 transitions, 5538 flow [2020-10-16 00:01:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1294 transitions. [2020-10-16 00:01:08,342 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5813117699910153 [2020-10-16 00:01:08,342 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1294 transitions. [2020-10-16 00:01:08,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1294 transitions. [2020-10-16 00:01:08,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:08,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1294 transitions. [2020-10-16 00:01:08,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:08,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:08,345 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:08,345 INFO L185 Difference]: Start difference. First operand has 244 places, 274 transitions, 4789 flow. Second operand 7 states and 1294 transitions. [2020-10-16 00:01:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 295 transitions, 5538 flow [2020-10-16 00:01:09,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 295 transitions, 5462 flow, removed 0 selfloop flow, removed 6 redundant places. [2020-10-16 00:01:09,121 INFO L241 Difference]: Finished difference. Result has 244 places, 272 transitions, 4795 flow [2020-10-16 00:01:09,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=4707, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4795, PETRI_PLACES=244, PETRI_TRANSITIONS=272} [2020-10-16 00:01:09,122 INFO L342 CegarLoopForPetriNet]: 57 programPoint places, 187 predicate places. [2020-10-16 00:01:09,122 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 272 transitions, 4795 flow [2020-10-16 00:01:09,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 00:01:09,122 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:09,122 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:09,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-16 00:01:09,122 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-16 00:01:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1460798848, now seen corresponding path program 1 times [2020-10-16 00:01:09,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:09,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350900524] [2020-10-16 00:01:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 00:01:09,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 00:01:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 00:01:09,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 00:01:09,182 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 00:01:09,182 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 00:01:09,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-16 00:01:09,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:09 BasicIcfg [2020-10-16 00:01:09,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 00:01:09,265 INFO L168 Benchmark]: Toolchain (without parser) took 137973.73 ms. Allocated memory was 251.1 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 204.0 MB in the beginning and 953.3 MB in the end (delta: -749.3 MB). Peak memory consumption was 4.4 GB. Max. memory is 14.2 GB. [2020-10-16 00:01:09,265 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 225.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 00:01:09,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.98 ms. Allocated memory was 251.1 MB in the beginning and 312.0 MB in the end (delta: 60.8 MB). Free memory was 204.0 MB in the beginning and 229.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 46.0 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:09,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 312.0 MB. Free memory is still 226.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 00:01:09,266 INFO L168 Benchmark]: Boogie Preprocessor took 27.48 ms. Allocated memory is still 312.0 MB. Free memory was 226.7 MB in the beginning and 224.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:09,267 INFO L168 Benchmark]: RCFGBuilder took 450.56 ms. Allocated memory is still 312.0 MB. Free memory was 224.2 MB in the beginning and 197.3 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:09,267 INFO L168 Benchmark]: TraceAbstraction took 136556.53 ms. Allocated memory was 312.0 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 197.3 MB in the beginning and 953.3 MB in the end (delta: -756.0 MB). Peak memory consumption was 4.4 GB. Max. memory is 14.2 GB. [2020-10-16 00:01:09,269 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 225.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 883.98 ms. Allocated memory was 251.1 MB in the beginning and 312.0 MB in the end (delta: 60.8 MB). Free memory was 204.0 MB in the beginning and 229.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 46.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 312.0 MB. Free memory is still 226.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * Boogie Preprocessor took 27.48 ms. Allocated memory is still 312.0 MB. Free memory was 226.7 MB in the beginning and 224.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 450.56 ms. Allocated memory is still 312.0 MB. Free memory was 224.2 MB in the beginning and 197.3 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 136556.53 ms. Allocated memory was 312.0 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 197.3 MB in the beginning and 953.3 MB in the end (delta: -756.0 MB). Peak memory consumption was 4.4 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3309 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 919 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.9s, 114 PlacesBefore, 57 PlacesAfterwards, 135 TransitionsBefore, 77 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 32154 MoverChecksTotal - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1124] 0 \read(t) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 0; [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 0; [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 0; [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={6:0}, t3={9:0}, t4={10:0}, t5={11:0}, v={-1:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 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: 136.1s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 129.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 1135 SDtfs, 2199 SDslu, 2732 SDs, 0 SdLazy, 9752 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5045occurred in iteration=36, 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.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 164996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...