/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:37:51,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:37:51,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:37:51,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:37:51,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:37:51,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:37:51,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:37:51,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:37:51,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:37:51,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:37:51,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:37:51,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:37:51,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:37:51,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:37:51,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:37:51,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:37:51,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:37:51,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:37:51,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:37:51,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:37:51,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:37:51,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:37:51,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:37:51,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:37:51,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:37:51,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:37:51,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:37:51,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:37:51,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:37:51,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:37:51,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:37:51,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:37:51,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:37:51,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:37:51,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:37:51,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:37:51,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:37:51,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:37:51,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:37:51,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:37:51,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:37:51,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:37:51,109 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:37:51,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:37:51,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:37:51,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:37:51,111 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:37:51,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:37:51,111 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:37:51,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:37:51,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:37:51,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:37:51,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:37:51,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:37:51,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:37:51,113 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:37:51,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:37:51,113 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:37:51,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:37:51,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:37:51,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:37:51,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:37:51,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:37:51,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:37:51,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:37:51,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:37:51,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:37:51,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:37:51,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:37:51,116 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:37:51,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:37:51,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:37:51,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:37:51,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:37:51,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:37:51,442 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:37:51,442 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:37:51,443 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-11 18:37:51,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cace3e0/941ddd154a1347308f523fa4ebd6ffe1/FLAGccf20bc5d [2020-10-11 18:37:52,076 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:37:52,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-11 18:37:52,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cace3e0/941ddd154a1347308f523fa4ebd6ffe1/FLAGccf20bc5d [2020-10-11 18:37:52,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cace3e0/941ddd154a1347308f523fa4ebd6ffe1 [2020-10-11 18:37:52,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:37:52,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:37:52,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:37:52,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:37:52,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:37:52,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:37:52" (1/1) ... [2020-10-11 18:37:52,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aee5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:52, skipping insertion in model container [2020-10-11 18:37:52,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:37:52" (1/1) ... [2020-10-11 18:37:52,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:37:52,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:37:53,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:37:53,169 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:37:53,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:37:53,323 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:37:53,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53 WrapperNode [2020-10-11 18:37:53,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:37:53,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:37:53,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:37:53,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:37:53,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:37:53,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:37:53,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:37:53,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:37:53,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (1/1) ... [2020-10-11 18:37:53,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:37:53,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:37:53,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:37:53,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:37:53,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (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-11 18:37:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:37:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:37:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:37:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:37:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:37:53,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:37:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:37:53,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:37:53,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:37:53,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:37:53,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:37:53,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:37:53,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:37:53,522 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:37:55,785 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:37:55,785 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:37:55,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:37:55 BoogieIcfgContainer [2020-10-11 18:37:55,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:37:55,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:37:55,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:37:55,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:37:55,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:37:52" (1/3) ... [2020-10-11 18:37:55,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6e35ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:37:55, skipping insertion in model container [2020-10-11 18:37:55,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:37:53" (2/3) ... [2020-10-11 18:37:55,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6e35ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:37:55, skipping insertion in model container [2020-10-11 18:37:55,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:37:55" (3/3) ... [2020-10-11 18:37:55,796 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2020-10-11 18:37:55,808 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:37:55,817 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:37:55,818 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:37:55,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,850 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,857 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,864 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,865 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,870 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:37:55,893 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:37:55,916 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:37:55,916 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:37:55,916 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:37:55,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:37:55,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:37:55,917 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:37:55,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:37:55,917 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:37:55,932 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:37:55,979 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-11 18:37:55,979 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:55,984 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:37:55,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:37:55,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-11 18:37:56,008 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2020-10-11 18:37:56,009 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:56,009 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:56,010 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] [2020-10-11 18:37:56,011 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -644128995, now seen corresponding path program 1 times [2020-10-11 18:37:56,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:56,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954035629] [2020-10-11 18:37:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:56,374 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-11 18:37:56,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954035629] [2020-10-11 18:37:56,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:56,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:37:56,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626514196] [2020-10-11 18:37:56,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:37:56,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:37:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:37:56,507 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 90 [2020-10-11 18:37:56,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states. [2020-10-11 18:37:56,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:56,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 90 [2020-10-11 18:37:56,511 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:56,540 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2020-10-11 18:37:56,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:56,541 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:37:56,542 INFO L132 encePairwiseOnDemand]: 85/90 looper letters, 0 selfloop transitions, 2 changer transitions 11/84 dead transitions. [2020-10-11 18:37:56,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 181 flow [2020-10-11 18:37:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:37:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:37:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2020-10-11 18:37:56,558 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2020-10-11 18:37:56,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2020-10-11 18:37:56,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2020-10-11 18:37:56,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:56,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2020-10-11 18:37:56,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:37:56,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:37:56,575 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:37:56,577 INFO L185 Difference]: Start difference. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states and 262 transitions. [2020-10-11 18:37:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 181 flow [2020-10-11 18:37:56,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:37:56,588 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 156 flow [2020-10-11 18:37:56,591 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-11 18:37:56,592 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2020-10-11 18:37:56,592 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 156 flow [2020-10-11 18:37:56,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:37:56,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:56,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:56,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:37:56,593 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1310755725, now seen corresponding path program 1 times [2020-10-11 18:37:56,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:56,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045590369] [2020-10-11 18:37:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:56,863 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-11 18:37:56,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045590369] [2020-10-11 18:37:56,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:56,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:37:56,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323876085] [2020-10-11 18:37:56,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:37:56,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:37:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:37:57,112 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 90 [2020-10-11 18:37:57,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 156 flow. Second operand 6 states. [2020-10-11 18:37:57,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:57,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 90 [2020-10-11 18:37:57,113 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:57,245 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-10-11 18:37:57,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:37:57,246 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 93. Up to 7 conditions per place. [2020-10-11 18:37:57,246 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 6 selfloop transitions, 2 changer transitions 10/83 dead transitions. [2020-10-11 18:37:57,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 212 flow [2020-10-11 18:37:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:37:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:37:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 740 transitions. [2020-10-11 18:37:57,253 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2020-10-11 18:37:57,253 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 740 transitions. [2020-10-11 18:37:57,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 740 transitions. [2020-10-11 18:37:57,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:57,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 740 transitions. [2020-10-11 18:37:57,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:37:57,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:37:57,263 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:37:57,263 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 156 flow. Second operand 9 states and 740 transitions. [2020-10-11 18:37:57,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 212 flow [2020-10-11 18:37:57,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:37:57,268 INFO L241 Difference]: Finished difference. Result has 95 places, 73 transitions, 172 flow [2020-10-11 18:37:57,269 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2020-10-11 18:37:57,269 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2020-10-11 18:37:57,269 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 172 flow [2020-10-11 18:37:57,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:37:57,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:57,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:37:57,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:37:57,270 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 295474258, now seen corresponding path program 1 times [2020-10-11 18:37:57,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:57,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160517500] [2020-10-11 18:37:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:57,489 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-11 18:37:57,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160517500] [2020-10-11 18:37:57,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:57,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:37:57,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380418069] [2020-10-11 18:37:57,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:37:57,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:37:57,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:37:57,749 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:37:57,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 172 flow. Second operand 7 states. [2020-10-11 18:37:57,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:57,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:37:57,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:57,987 INFO L129 PetriNetUnfolder]: 30/169 cut-off events. [2020-10-11 18:37:57,988 INFO L130 PetriNetUnfolder]: For 35/72 co-relation queries the response was YES. [2020-10-11 18:37:57,991 INFO L80 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 169 events. 30/169 cut-off events. For 35/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 564 event pairs, 0 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 280. Up to 31 conditions per place. [2020-10-11 18:37:57,992 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 5 changer transitions 21/98 dead transitions. [2020-10-11 18:37:57,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 98 transitions, 317 flow [2020-10-11 18:37:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:37:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:37:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 808 transitions. [2020-10-11 18:37:57,996 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977777777777778 [2020-10-11 18:37:57,996 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 808 transitions. [2020-10-11 18:37:57,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 808 transitions. [2020-10-11 18:37:57,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:57,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 808 transitions. [2020-10-11 18:37:58,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:37:58,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:37:58,007 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:37:58,007 INFO L185 Difference]: Start difference. First operand has 95 places, 73 transitions, 172 flow. Second operand 10 states and 808 transitions. [2020-10-11 18:37:58,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 98 transitions, 317 flow [2020-10-11 18:37:58,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 98 transitions, 283 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:37:58,018 INFO L241 Difference]: Finished difference. Result has 98 places, 75 transitions, 210 flow [2020-10-11 18:37:58,023 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2020-10-11 18:37:58,023 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2020-10-11 18:37:58,023 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 210 flow [2020-10-11 18:37:58,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:37:58,031 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:58,033 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:37:58,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:37:58,033 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 160508021, now seen corresponding path program 1 times [2020-10-11 18:37:58,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:58,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645495865] [2020-10-11 18:37:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:37:58,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645495865] [2020-10-11 18:37:58,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:58,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:37:58,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518679183] [2020-10-11 18:37:58,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:37:58,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:37:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:37:58,878 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:37:58,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 210 flow. Second operand 10 states. [2020-10-11 18:37:58,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:37:58,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:37:58,880 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:37:59,561 INFO L129 PetriNetUnfolder]: 458/1017 cut-off events. [2020-10-11 18:37:59,562 INFO L130 PetriNetUnfolder]: For 844/858 co-relation queries the response was YES. [2020-10-11 18:37:59,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1017 events. 458/1017 cut-off events. For 844/858 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6041 event pairs, 136 based on Foata normal form. 30/1017 useless extension candidates. Maximal degree in co-relation 2317. Up to 411 conditions per place. [2020-10-11 18:37:59,576 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 14 selfloop transitions, 10 changer transitions 44/127 dead transitions. [2020-10-11 18:37:59,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 486 flow [2020-10-11 18:37:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:37:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:37:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1136 transitions. [2020-10-11 18:37:59,581 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8414814814814815 [2020-10-11 18:37:59,582 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1136 transitions. [2020-10-11 18:37:59,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1136 transitions. [2020-10-11 18:37:59,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:37:59,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1136 transitions. [2020-10-11 18:37:59,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:37:59,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:37:59,590 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:37:59,591 INFO L185 Difference]: Start difference. First operand has 98 places, 75 transitions, 210 flow. Second operand 15 states and 1136 transitions. [2020-10-11 18:37:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 486 flow [2020-10-11 18:37:59,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 127 transitions, 455 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:37:59,602 INFO L241 Difference]: Finished difference. Result has 112 places, 81 transitions, 279 flow [2020-10-11 18:37:59,603 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=279, PETRI_PLACES=112, PETRI_TRANSITIONS=81} [2020-10-11 18:37:59,603 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2020-10-11 18:37:59,603 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 81 transitions, 279 flow [2020-10-11 18:37:59,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:37:59,603 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:37:59,604 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:37:59,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:37:59,604 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:37:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:37:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2122943111, now seen corresponding path program 1 times [2020-10-11 18:37:59,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:37:59,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252412096] [2020-10-11 18:37:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:37:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:37:59,948 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-11 18:37:59,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252412096] [2020-10-11 18:37:59,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:37:59,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:37:59,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942961766] [2020-10-11 18:37:59,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:37:59,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:37:59,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:37:59,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:38:00,643 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:38:00,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 81 transitions, 279 flow. Second operand 12 states. [2020-10-11 18:38:00,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:00,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:38:00,646 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:01,179 INFO L129 PetriNetUnfolder]: 326/729 cut-off events. [2020-10-11 18:38:01,179 INFO L130 PetriNetUnfolder]: For 2203/2234 co-relation queries the response was YES. [2020-10-11 18:38:01,185 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 729 events. 326/729 cut-off events. For 2203/2234 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3740 event pairs, 133 based on Foata normal form. 22/727 useless extension candidates. Maximal degree in co-relation 2469. Up to 395 conditions per place. [2020-10-11 18:38:01,191 INFO L132 encePairwiseOnDemand]: 77/90 looper letters, 15 selfloop transitions, 14 changer transitions 35/122 dead transitions. [2020-10-11 18:38:01,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 122 transitions, 687 flow [2020-10-11 18:38:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:38:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:38:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1183 transitions. [2020-10-11 18:38:01,196 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8215277777777777 [2020-10-11 18:38:01,197 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1183 transitions. [2020-10-11 18:38:01,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1183 transitions. [2020-10-11 18:38:01,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:01,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1183 transitions. [2020-10-11 18:38:01,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:38:01,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:38:01,204 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:38:01,204 INFO L185 Difference]: Start difference. First operand has 112 places, 81 transitions, 279 flow. Second operand 16 states and 1183 transitions. [2020-10-11 18:38:01,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 122 transitions, 687 flow [2020-10-11 18:38:01,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 122 transitions, 665 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-11 18:38:01,211 INFO L241 Difference]: Finished difference. Result has 124 places, 85 transitions, 379 flow [2020-10-11 18:38:01,212 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=379, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2020-10-11 18:38:01,212 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 29 predicate places. [2020-10-11 18:38:01,212 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 85 transitions, 379 flow [2020-10-11 18:38:01,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:38:01,212 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:01,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:38:01,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:38:01,213 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash -455080539, now seen corresponding path program 1 times [2020-10-11 18:38:01,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:01,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355632568] [2020-10-11 18:38:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:01,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-11 18:38:01,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355632568] [2020-10-11 18:38:01,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:01,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:38:01,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329563643] [2020-10-11 18:38:01,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:38:01,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:38:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:38:01,886 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2020-10-11 18:38:01,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 85 transitions, 379 flow. Second operand 8 states. [2020-10-11 18:38:01,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:01,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2020-10-11 18:38:01,887 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:02,379 INFO L129 PetriNetUnfolder]: 355/903 cut-off events. [2020-10-11 18:38:02,379 INFO L130 PetriNetUnfolder]: For 6704/7208 co-relation queries the response was YES. [2020-10-11 18:38:02,387 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 903 events. 355/903 cut-off events. For 6704/7208 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5792 event pairs, 66 based on Foata normal form. 27/906 useless extension candidates. Maximal degree in co-relation 3615. Up to 279 conditions per place. [2020-10-11 18:38:02,397 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 22 selfloop transitions, 10 changer transitions 31/124 dead transitions. [2020-10-11 18:38:02,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 917 flow [2020-10-11 18:38:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:38:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:38:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 869 transitions. [2020-10-11 18:38:02,407 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2020-10-11 18:38:02,408 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 869 transitions. [2020-10-11 18:38:02,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 869 transitions. [2020-10-11 18:38:02,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:02,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 869 transitions. [2020-10-11 18:38:02,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:38:02,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:38:02,415 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:38:02,415 INFO L185 Difference]: Start difference. First operand has 124 places, 85 transitions, 379 flow. Second operand 11 states and 869 transitions. [2020-10-11 18:38:02,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 917 flow [2020-10-11 18:38:02,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 124 transitions, 723 flow, removed 94 selfloop flow, removed 12 redundant places. [2020-10-11 18:38:02,430 INFO L241 Difference]: Finished difference. Result has 120 places, 88 transitions, 409 flow [2020-10-11 18:38:02,431 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=409, PETRI_PLACES=120, PETRI_TRANSITIONS=88} [2020-10-11 18:38:02,431 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 25 predicate places. [2020-10-11 18:38:02,431 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 88 transitions, 409 flow [2020-10-11 18:38:02,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:38:02,432 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:02,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:38:02,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:38:02,432 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -894499185, now seen corresponding path program 1 times [2020-10-11 18:38:02,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:02,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220459311] [2020-10-11 18:38:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:02,659 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-11 18:38:02,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220459311] [2020-10-11 18:38:02,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:02,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:38:02,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071225074] [2020-10-11 18:38:02,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:38:02,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:38:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:38:02,898 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:38:02,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 88 transitions, 409 flow. Second operand 7 states. [2020-10-11 18:38:02,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:02,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:38:02,899 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:03,352 INFO L129 PetriNetUnfolder]: 329/1078 cut-off events. [2020-10-11 18:38:03,352 INFO L130 PetriNetUnfolder]: For 7316/7792 co-relation queries the response was YES. [2020-10-11 18:38:03,360 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1078 events. 329/1078 cut-off events. For 7316/7792 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8207 event pairs, 67 based on Foata normal form. 67/1086 useless extension candidates. Maximal degree in co-relation 4472. Up to 401 conditions per place. [2020-10-11 18:38:03,366 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 14 selfloop transitions, 3 changer transitions 18/109 dead transitions. [2020-10-11 18:38:03,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 109 transitions, 679 flow [2020-10-11 18:38:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:38:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:38:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1114 transitions. [2020-10-11 18:38:03,371 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8841269841269841 [2020-10-11 18:38:03,371 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1114 transitions. [2020-10-11 18:38:03,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1114 transitions. [2020-10-11 18:38:03,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:03,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1114 transitions. [2020-10-11 18:38:03,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:38:03,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:38:03,378 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:38:03,378 INFO L185 Difference]: Start difference. First operand has 120 places, 88 transitions, 409 flow. Second operand 14 states and 1114 transitions. [2020-10-11 18:38:03,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 109 transitions, 679 flow [2020-10-11 18:38:03,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 109 transitions, 629 flow, removed 19 selfloop flow, removed 6 redundant places. [2020-10-11 18:38:03,390 INFO L241 Difference]: Finished difference. Result has 133 places, 87 transitions, 413 flow [2020-10-11 18:38:03,390 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=413, PETRI_PLACES=133, PETRI_TRANSITIONS=87} [2020-10-11 18:38:03,390 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2020-10-11 18:38:03,391 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 87 transitions, 413 flow [2020-10-11 18:38:03,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:38:03,391 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:03,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:38:03,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:38:03,391 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2080773649, now seen corresponding path program 1 times [2020-10-11 18:38:03,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:03,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13493695] [2020-10-11 18:38:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:03,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-11 18:38:03,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13493695] [2020-10-11 18:38:03,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:03,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:38:03,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061189524] [2020-10-11 18:38:03,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:38:03,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:38:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:38:04,573 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:38:04,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 87 transitions, 413 flow. Second operand 10 states. [2020-10-11 18:38:04,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:04,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:38:04,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:05,160 INFO L129 PetriNetUnfolder]: 341/902 cut-off events. [2020-10-11 18:38:05,161 INFO L130 PetriNetUnfolder]: For 7316/7410 co-relation queries the response was YES. [2020-10-11 18:38:05,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 902 events. 341/902 cut-off events. For 7316/7410 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5527 event pairs, 141 based on Foata normal form. 16/895 useless extension candidates. Maximal degree in co-relation 4175. Up to 475 conditions per place. [2020-10-11 18:38:05,174 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 31 selfloop transitions, 12 changer transitions 25/127 dead transitions. [2020-10-11 18:38:05,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 991 flow [2020-10-11 18:38:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:38:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:38:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1122 transitions. [2020-10-11 18:38:05,179 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8311111111111111 [2020-10-11 18:38:05,179 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1122 transitions. [2020-10-11 18:38:05,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1122 transitions. [2020-10-11 18:38:05,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:05,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1122 transitions. [2020-10-11 18:38:05,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:38:05,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:38:05,185 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:38:05,185 INFO L185 Difference]: Start difference. First operand has 133 places, 87 transitions, 413 flow. Second operand 15 states and 1122 transitions. [2020-10-11 18:38:05,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 991 flow [2020-10-11 18:38:05,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 127 transitions, 892 flow, removed 45 selfloop flow, removed 13 redundant places. [2020-10-11 18:38:05,200 INFO L241 Difference]: Finished difference. Result has 133 places, 91 transitions, 466 flow [2020-10-11 18:38:05,200 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=466, PETRI_PLACES=133, PETRI_TRANSITIONS=91} [2020-10-11 18:38:05,200 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2020-10-11 18:38:05,201 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 91 transitions, 466 flow [2020-10-11 18:38:05,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:38:05,201 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:05,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:38:05,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:38:05,201 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1802034615, now seen corresponding path program 2 times [2020-10-11 18:38:05,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:05,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874174450] [2020-10-11 18:38:05,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:05,488 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-11 18:38:05,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874174450] [2020-10-11 18:38:05,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:05,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:38:05,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420246322] [2020-10-11 18:38:05,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:38:05,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:38:05,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:38:05,941 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:38:05,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 91 transitions, 466 flow. Second operand 12 states. [2020-10-11 18:38:05,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:05,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:38:05,943 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:06,533 INFO L129 PetriNetUnfolder]: 340/876 cut-off events. [2020-10-11 18:38:06,533 INFO L130 PetriNetUnfolder]: For 8351/8484 co-relation queries the response was YES. [2020-10-11 18:38:06,538 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4559 conditions, 876 events. 340/876 cut-off events. For 8351/8484 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5180 event pairs, 141 based on Foata normal form. 22/878 useless extension candidates. Maximal degree in co-relation 4475. Up to 460 conditions per place. [2020-10-11 18:38:06,546 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 29 selfloop transitions, 10 changer transitions 25/122 dead transitions. [2020-10-11 18:38:06,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 122 transitions, 1004 flow [2020-10-11 18:38:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:38:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:38:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 961 transitions. [2020-10-11 18:38:06,553 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8213675213675213 [2020-10-11 18:38:06,553 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 961 transitions. [2020-10-11 18:38:06,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 961 transitions. [2020-10-11 18:38:06,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:06,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 961 transitions. [2020-10-11 18:38:06,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:38:06,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:38:06,565 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:38:06,565 INFO L185 Difference]: Start difference. First operand has 133 places, 91 transitions, 466 flow. Second operand 13 states and 961 transitions. [2020-10-11 18:38:06,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 122 transitions, 1004 flow [2020-10-11 18:38:06,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 878 flow, removed 57 selfloop flow, removed 12 redundant places. [2020-10-11 18:38:06,580 INFO L241 Difference]: Finished difference. Result has 131 places, 91 transitions, 453 flow [2020-10-11 18:38:06,580 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=453, PETRI_PLACES=131, PETRI_TRANSITIONS=91} [2020-10-11 18:38:06,580 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 36 predicate places. [2020-10-11 18:38:06,580 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 91 transitions, 453 flow [2020-10-11 18:38:06,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:38:06,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:06,581 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, 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-11 18:38:06,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:38:06,581 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -36362339, now seen corresponding path program 1 times [2020-10-11 18:38:06,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:06,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950152332] [2020-10-11 18:38:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:06,915 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-11 18:38:06,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950152332] [2020-10-11 18:38:06,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:06,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:38:06,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021625358] [2020-10-11 18:38:06,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:38:06,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:38:06,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:38:07,653 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2020-10-11 18:38:07,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 91 transitions, 453 flow. Second operand 12 states. [2020-10-11 18:38:07,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:07,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2020-10-11 18:38:07,654 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:08,115 INFO L129 PetriNetUnfolder]: 290/831 cut-off events. [2020-10-11 18:38:08,115 INFO L130 PetriNetUnfolder]: For 6127/6300 co-relation queries the response was YES. [2020-10-11 18:38:08,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 831 events. 290/831 cut-off events. For 6127/6300 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5172 event pairs, 66 based on Foata normal form. 36/846 useless extension candidates. Maximal degree in co-relation 3732. Up to 380 conditions per place. [2020-10-11 18:38:08,128 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 24 selfloop transitions, 14 changer transitions 28/123 dead transitions. [2020-10-11 18:38:08,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 123 transitions, 939 flow [2020-10-11 18:38:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:38:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:38:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1016 transitions. [2020-10-11 18:38:08,132 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2020-10-11 18:38:08,132 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1016 transitions. [2020-10-11 18:38:08,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1016 transitions. [2020-10-11 18:38:08,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:08,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1016 transitions. [2020-10-11 18:38:08,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:38:08,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:38:08,137 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:38:08,137 INFO L185 Difference]: Start difference. First operand has 131 places, 91 transitions, 453 flow. Second operand 14 states and 1016 transitions. [2020-10-11 18:38:08,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 123 transitions, 939 flow [2020-10-11 18:38:08,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 873 flow, removed 25 selfloop flow, removed 14 redundant places. [2020-10-11 18:38:08,152 INFO L241 Difference]: Finished difference. Result has 131 places, 93 transitions, 502 flow [2020-10-11 18:38:08,152 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=502, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2020-10-11 18:38:08,153 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 36 predicate places. [2020-10-11 18:38:08,153 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 502 flow [2020-10-11 18:38:08,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:38:08,153 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:08,153 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, 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-11 18:38:08,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:38:08,154 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1167341672, now seen corresponding path program 1 times [2020-10-11 18:38:08,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:08,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119350604] [2020-10-11 18:38:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:08,259 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-11 18:38:08,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119350604] [2020-10-11 18:38:08,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:08,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:38:08,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553402964] [2020-10-11 18:38:08,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:38:08,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:38:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:38:08,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:38:08,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 502 flow. Second operand 6 states. [2020-10-11 18:38:08,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:08,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:38:08,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:08,746 INFO L129 PetriNetUnfolder]: 604/1746 cut-off events. [2020-10-11 18:38:08,746 INFO L130 PetriNetUnfolder]: For 6531/6633 co-relation queries the response was YES. [2020-10-11 18:38:08,760 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 1746 events. 604/1746 cut-off events. For 6531/6633 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 14602 event pairs, 141 based on Foata normal form. 57/1681 useless extension candidates. Maximal degree in co-relation 5023. Up to 413 conditions per place. [2020-10-11 18:38:08,769 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 19 selfloop transitions, 16 changer transitions 0/118 dead transitions. [2020-10-11 18:38:08,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 118 transitions, 622 flow [2020-10-11 18:38:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:38:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:38:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2020-10-11 18:38:08,772 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2020-10-11 18:38:08,772 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2020-10-11 18:38:08,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2020-10-11 18:38:08,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:08,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2020-10-11 18:38:08,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:38:08,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:38:08,775 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:38:08,775 INFO L185 Difference]: Start difference. First operand has 131 places, 93 transitions, 502 flow. Second operand 9 states and 730 transitions. [2020-10-11 18:38:08,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 118 transitions, 622 flow [2020-10-11 18:38:08,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 581 flow, removed 10 selfloop flow, removed 9 redundant places. [2020-10-11 18:38:08,788 INFO L241 Difference]: Finished difference. Result has 129 places, 107 transitions, 572 flow [2020-10-11 18:38:08,789 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2020-10-11 18:38:08,789 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 34 predicate places. [2020-10-11 18:38:08,789 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 572 flow [2020-10-11 18:38:08,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:38:08,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:08,790 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, 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-11 18:38:08,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:38:08,790 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 642492919, now seen corresponding path program 1 times [2020-10-11 18:38:08,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:08,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621181697] [2020-10-11 18:38:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:08,898 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-11 18:38:08,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621181697] [2020-10-11 18:38:08,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:08,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:38:08,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916055279] [2020-10-11 18:38:08,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:38:08,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:38:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:38:08,989 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:38:08,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 572 flow. Second operand 7 states. [2020-10-11 18:38:08,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:08,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:38:08,990 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:09,342 INFO L129 PetriNetUnfolder]: 424/1387 cut-off events. [2020-10-11 18:38:09,342 INFO L130 PetriNetUnfolder]: For 4234/5064 co-relation queries the response was YES. [2020-10-11 18:38:09,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1387 events. 424/1387 cut-off events. For 4234/5064 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 12062 event pairs, 18 based on Foata normal form. 277/1556 useless extension candidates. Maximal degree in co-relation 4614. Up to 393 conditions per place. [2020-10-11 18:38:09,360 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 15 selfloop transitions, 31 changer transitions 6/134 dead transitions. [2020-10-11 18:38:09,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 852 flow [2020-10-11 18:38:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:38:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:38:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 974 transitions. [2020-10-11 18:38:09,363 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9018518518518519 [2020-10-11 18:38:09,363 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 974 transitions. [2020-10-11 18:38:09,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 974 transitions. [2020-10-11 18:38:09,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:09,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 974 transitions. [2020-10-11 18:38:09,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:38:09,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:38:09,367 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:38:09,367 INFO L185 Difference]: Start difference. First operand has 129 places, 107 transitions, 572 flow. Second operand 12 states and 974 transitions. [2020-10-11 18:38:09,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 852 flow [2020-10-11 18:38:09,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 841 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-11 18:38:09,382 INFO L241 Difference]: Finished difference. Result has 141 places, 125 transitions, 786 flow [2020-10-11 18:38:09,382 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=786, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2020-10-11 18:38:09,382 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 46 predicate places. [2020-10-11 18:38:09,383 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 786 flow [2020-10-11 18:38:09,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:38:09,383 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:09,383 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, 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-11 18:38:09,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:38:09,383 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -912068062, now seen corresponding path program 1 times [2020-10-11 18:38:09,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:09,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243738674] [2020-10-11 18:38:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:09,547 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-11 18:38:09,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243738674] [2020-10-11 18:38:09,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:09,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:38:09,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478768009] [2020-10-11 18:38:09,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:38:09,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:38:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:38:09,699 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:38:09,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 786 flow. Second operand 8 states. [2020-10-11 18:38:09,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:09,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:38:09,700 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:10,147 INFO L129 PetriNetUnfolder]: 352/1241 cut-off events. [2020-10-11 18:38:10,148 INFO L130 PetriNetUnfolder]: For 4770/6014 co-relation queries the response was YES. [2020-10-11 18:38:10,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 1241 events. 352/1241 cut-off events. For 4770/6014 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 11291 event pairs, 2 based on Foata normal form. 264/1399 useless extension candidates. Maximal degree in co-relation 4603. Up to 348 conditions per place. [2020-10-11 18:38:10,163 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 36 changer transitions 27/144 dead transitions. [2020-10-11 18:38:10,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 144 transitions, 1040 flow [2020-10-11 18:38:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:38:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:38:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1206 transitions. [2020-10-11 18:38:10,165 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2020-10-11 18:38:10,165 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1206 transitions. [2020-10-11 18:38:10,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1206 transitions. [2020-10-11 18:38:10,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:10,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1206 transitions. [2020-10-11 18:38:10,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:38:10,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:38:10,170 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:38:10,170 INFO L185 Difference]: Start difference. First operand has 141 places, 125 transitions, 786 flow. Second operand 15 states and 1206 transitions. [2020-10-11 18:38:10,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 144 transitions, 1040 flow [2020-10-11 18:38:10,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 144 transitions, 818 flow, removed 95 selfloop flow, removed 17 redundant places. [2020-10-11 18:38:10,209 INFO L241 Difference]: Finished difference. Result has 144 places, 114 transitions, 623 flow [2020-10-11 18:38:10,210 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=623, PETRI_PLACES=144, PETRI_TRANSITIONS=114} [2020-10-11 18:38:10,210 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 49 predicate places. [2020-10-11 18:38:10,210 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 114 transitions, 623 flow [2020-10-11 18:38:10,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:38:10,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:10,210 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, 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-11 18:38:10,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:38:10,211 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 448733389, now seen corresponding path program 1 times [2020-10-11 18:38:10,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:10,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703608458] [2020-10-11 18:38:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:38:10,504 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-11 18:38:10,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703608458] [2020-10-11 18:38:10,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:38:10,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:38:10,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329126640] [2020-10-11 18:38:10,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:38:10,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:38:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:38:10,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:38:12,815 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:38:12,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 114 transitions, 623 flow. Second operand 13 states. [2020-10-11 18:38:12,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:38:12,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:38:12,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:38:13,069 INFO L129 PetriNetUnfolder]: 158/674 cut-off events. [2020-10-11 18:38:13,069 INFO L130 PetriNetUnfolder]: For 1488/1620 co-relation queries the response was YES. [2020-10-11 18:38:13,073 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 674 events. 158/674 cut-off events. For 1488/1620 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5379 event pairs, 0 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 1901. Up to 82 conditions per place. [2020-10-11 18:38:13,075 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 13 selfloop transitions, 12 changer transitions 6/121 dead transitions. [2020-10-11 18:38:13,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 121 transitions, 733 flow [2020-10-11 18:38:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:38:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:38:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 878 transitions. [2020-10-11 18:38:13,078 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.812962962962963 [2020-10-11 18:38:13,078 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 878 transitions. [2020-10-11 18:38:13,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 878 transitions. [2020-10-11 18:38:13,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:38:13,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 878 transitions. [2020-10-11 18:38:13,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:38:13,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:38:13,081 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:38:13,081 INFO L185 Difference]: Start difference. First operand has 144 places, 114 transitions, 623 flow. Second operand 12 states and 878 transitions. [2020-10-11 18:38:13,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 121 transitions, 733 flow [2020-10-11 18:38:13,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 604 flow, removed 29 selfloop flow, removed 23 redundant places. [2020-10-11 18:38:13,093 INFO L241 Difference]: Finished difference. Result has 133 places, 114 transitions, 556 flow [2020-10-11 18:38:13,094 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=556, PETRI_PLACES=133, PETRI_TRANSITIONS=114} [2020-10-11 18:38:13,094 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2020-10-11 18:38:13,094 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 114 transitions, 556 flow [2020-10-11 18:38:13,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:38:13,094 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:38:13,095 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, 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-11 18:38:13,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:38:13,095 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:38:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:38:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1469452245, now seen corresponding path program 2 times [2020-10-11 18:38:13,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:38:13,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848376282] [2020-10-11 18:38:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:38:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:38:13,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:38:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:38:13,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:38:13,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:38:13,221 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:38:13,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:38:13,255 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,257 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,257 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,258 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,258 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,258 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,262 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,262 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,262 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,262 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,263 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,264 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,264 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,265 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,265 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,265 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,268 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,268 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,268 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,268 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,269 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,269 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,270 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,270 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,270 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:38:13,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:38:13,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:38:13 BasicIcfg [2020-10-11 18:38:13,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:38:13,384 INFO L168 Benchmark]: Toolchain (without parser) took 21025.40 ms. Allocated memory was 249.6 MB in the beginning and 618.7 MB in the end (delta: 369.1 MB). Free memory was 205.5 MB in the beginning and 314.8 MB in the end (delta: -109.3 MB). Peak memory consumption was 259.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,386 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 961.95 ms. Allocated memory was 249.6 MB in the beginning and 315.6 MB in the end (delta: 66.1 MB). Free memory was 204.6 MB in the beginning and 264.2 MB in the end (delta: -59.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.41 ms. Allocated memory is still 315.6 MB. Free memory was 264.2 MB in the beginning and 261.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,393 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 315.6 MB. Free memory was 261.7 MB in the beginning and 259.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,393 INFO L168 Benchmark]: RCFGBuilder took 2354.87 ms. Allocated memory was 315.6 MB in the beginning and 353.4 MB in the end (delta: 37.7 MB). Free memory was 259.2 MB in the beginning and 184.7 MB in the end (delta: 74.5 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,394 INFO L168 Benchmark]: TraceAbstraction took 17591.82 ms. Allocated memory was 353.4 MB in the beginning and 618.7 MB in the end (delta: 265.3 MB). Free memory was 182.7 MB in the beginning and 314.8 MB in the end (delta: -132.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:38:13,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 961.95 ms. Allocated memory was 249.6 MB in the beginning and 315.6 MB in the end (delta: 66.1 MB). Free memory was 204.6 MB in the beginning and 264.2 MB in the end (delta: -59.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.41 ms. Allocated memory is still 315.6 MB. Free memory was 264.2 MB in the beginning and 261.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 315.6 MB. Free memory was 261.7 MB in the beginning and 259.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2354.87 ms. Allocated memory was 315.6 MB in the beginning and 353.4 MB in the end (delta: 37.7 MB). Free memory was 259.2 MB in the beginning and 184.7 MB in the end (delta: 74.5 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17591.82 ms. Allocated memory was 353.4 MB in the beginning and 618.7 MB in the end (delta: 265.3 MB). Free memory was 182.7 MB in the beginning and 314.8 MB in the end (delta: -132.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L717] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L718] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L719] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L720] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L721] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L722] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 pthread_t t2186; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2187; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 0 pthread_t t2188; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 442 SDtfs, 756 SDslu, 1998 SDs, 0 SdLazy, 1767 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=786occurred in iteration=12, 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.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 292587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...